Each _______ has its own index block.

A. Partition
B. Address
C. File
D. All of the mentioned

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

A. External €? fragmentation & size €? declaration
B. Internal €? fragmentation & external €? fragmentation
C. Size €? declaration & internal €? fragmentation
D. Memory €? allocation & size €? declaration

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

A. Fat
B. Linked allocation
C. Hashed allocation
D. Indexed allocation

The FAT is used much as a _________

A. Stack
B. Linked list
C. Data
D. Pointer

If the extents are too large, then what is the problem that comes in?

A. Internal fragmentation
B. External fragmentation
C. Starvation
D. All of the mentioned

A better way of contiguous allocation to extend the file size is _____________

A. Adding an extent (another chunk of contiguous space)
B. Adding an index table to the first contiguous block
C. Adding pointers into the first contiguous block
D. None of the mentioned

By using FAT, random access time is __________

A. The same
B. Increased
C. Decreased
D. Not affected

FAT stands for _____________

A. File attribute transport
B. File allocation table
C. Fork at time
D. None of the mentioned

What if a pointer is lost or damaged in a linked allocation?

A. The entire file could get damaged
B. Only a part of the file would be affected
C. There would not be any problems
D. None of the mentioned

What is the major disadvantage with a linked allocation?

A. Internal fragmentation
B. External fragmentation
C. There is no sequential access
D. There is only sequential access