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

• A. Can
• B. Cannot
• C. Is
• D. None of the mentioned

When in contiguous allocation the space cannot be extended easily?

• A. The contents of the file have to be copied to a new space, a larger hole
• B. The file gets destroyed
• C. The file will get formatted and lost all its data
• D. None of the mentioned

In the linked allocation, the directory contains a pointer to which block? I. first block II. last block

• A. I only
• B. Ii only
• C. Both i and ii
• D. Neither i nor ii

There is no __________ with linked allocation.

• A. Internal fragmentation
• B. External fragmentation
• C. Starvation
• D. All 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

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

FAT stands for _____________

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

By using FAT, random access time is __________

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

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

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