The pointer overhead of indexed allocation is generally _________ the pointer overhead of linked allocation.

  1. Home

Question:
The pointer overhead of indexed allocation is generally _________ the pointer overhead of linked allocation.

1. less than

2.equal to

3.greater than

4.keeps varying with

Posted Date:-2022-03-29 08:17:48

More MCQS Questions and answers

  1. By using FAT, random access time is ______
  2. If each access to a file is controlled by a password, then what is the disadvantage?
  3. If the extents are too large, then what is the problem that comes in?internal fragmentation
  4. In contiguous allocation _____
  5. In UNIX, groups can be created and modified by?
  6. ______ and ________ are the most common strategies used to select a free hole from the set of available holes.
  7. A better way of contiguous allocation to extend the file size is _____
  8. A device driver can be thought of like a translator. Its input consists of _____ commands and output consists of _______ instructions.
  9. A section of disk at the beginning of each partition is set aside to contain the table in ______
  10. All users in a group get _______ access to a file.
  11. Consider a disk where blocks 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 17, 18, 25, 26 and 27 are free and the rest of the blocks are allocated. Then the free space bitmap would be _______
  12. Contiguous allocation has two problems _________ and _________ that linked allocation solves.
  13. Contiguous allocation of a file is defined by ______
  14. Disks are segmented into one or more partitions, each containing a file system or ______
  15. Distributed naming services/Distributed information systems have been devised to ________
  16. Domain name system provides _____
  17. During compaction time, other normal system operations _______ be permitted.
  18. Each _______ has its own index block.
  19. FAT stands for ______
  20. For any type of access, contiguous allocation requires ______ access to get a disk block.
  21. For each file there exists a ___________ that contains information about the file, including ownership, permissions and location of the file contents.
  22. For processes to request access to file contents, they need _____
  23. If too little space is allocated to a file _______
  24. In indexed allocation _________
  25. In linked allocation _________
  26. In the linked allocation, the directory contains a pointer to which block? I. first block II. last block
  27. In UNIX, the directory protection is handled _________ to the file protection.
  28. Indexed allocation _________ direct access.
  29. Many systems recognize three classifications of users in connection with each file (to condense the access control list).
  30. Metadata includes _______
  31. One difficulty of contiguous allocation is ____
  32. Protection is only provided at the _____ level.
  33. Reliability of files can be increased by _______
  34. The FAT is used much as a _______
  35. The file organization module knows about ______
  36. The first fit and best fit algorithms suffer from _________
  37. The pointer overhead of indexed allocation is generally _________ the pointer overhead of linked allocation.
  38. The series of accesses between the open and close operations is a _______
  39. The three major methods of allocating disk space that are in wide use are _______
  40. The VFS (virtual file system) activates file system specific operations to handle local requests according to their _______
  41. There is no __________ with linked allocation.
  42. To control access the three bits used in UNIX are represented by ______
  43. To solve the problem of external fragmentation ________ needs to be done periodically.
  44. Universe consists of _______
  45. What if a pointer is lost or damaged in a linked allocation?
  46. What is the main problem with access control lists?
  47. What is the major disadvantage with a linked allocation?
  48. What is the real disadvantage of a linear list of directory entries?
  49. What will happen in a multi level directory structure?
  50. When in contiguous allocation the space cannot be extended easily?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!