Q. 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 bit map would be :

View solution

Q. For any type of access, contiguous allocation requires ______ access to get a disk block.

View solution

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

View solution

Q. Indexed allocation _________ direct access.

View solution

Q. Each _______ has its own index block.

View solution

Q. Contiguous allocation has two problems _________ and _________ that linked allocation solves.

View solution

Q. A section of disk at the beginning of each partition is set aside to contain the table in :

View solution

Q. The FAT is used much as a _________

View solution

Q. If the extents are too large, then the problem that comes in is :

View solution

Q. A better way of contiguous allocation to extend the file size is :

View solution

Q. By using FAT, random access time is __________

View solution

Q. FAT stands for :

View solution

Q. If a pointer is lost or damaged in a linked allocation :

View solution

Q. The major disadvantage with linked allocation is that :

View solution

Q. There is no __________ with linked allocation.

View solution

Q. When in contiguous allocation the space cannot be extended easily :

View solution

Q. During compaction time, other normal system operations _______ be permitted.

View solution

Q. For processes to request access to file contents, they need to :

View solution

Q. For each file their exists a ___________ that contains information about the file, including ownership, permissions and location of the file contents.

View solution

Q. Metadata includes :

View solution