File Allocation Methods — Concept Check
Questions on File Allocation Methods. Filesystems use contiguous, linked, or indexed allocation to map logical file blocks to physical disk blocks, each with different trade-offs in performance, fragmentation, and random-access speed.
Questions in this quiz
7 questions on File Allocation Methods — Concept Check. Work through them here, then start the quiz to answer them and see your score.
1.A file stored on a disk using contiguous allocation needs to grow in size. What is a potential issue you might face?
- ARandom access speed will decrease significantly.
- BThe file may become fragmented internally.
- CExternal fragmentation may prevent file growth.
- DThe file system will need to move the file to a new location.
2.A system using linked allocation for files is experiencing slow file access times. What is likely the cause?
- AThe system has to read each block to follow pointers.
- BThe FAT table is not optimized for this system.
- CThe index block is too large to handle efficiently.
- DHigh external fragmentation is causing delays.
3.In a filesystem using FAT, what advantage does it have over traditional linked allocation?
- AFAT eliminates the need for a directory entry.
- BFAT allows for O(1) random access to file blocks.
- CFAT stores pointers in memory, improving access speed.
- DFAT reduces the space required for storing pointers.
4.A Unix system is using indexed allocation with inodes. What happens when a file exceeds the size that direct pointers can handle?
- AThe file cannot grow beyond this size.
- BThe inode table is expanded to accommodate more pointers.
- CThe system switches to using indirect blocks.
- DThe file is fragmented across the disk.
5.In a filesystem using extents, what is the main benefit over traditional contiguous allocation?
- AExtents reduce the need for an index block.
- BExtents improve random access speed significantly.
- CExtents handle file growth more efficiently.
- DExtents eliminate all forms of fragmentation.
6.A file stored using linked allocation is frequently accessed randomly. What is a likely performance issue?
- AThe index block will become a bottleneck.
- BThe file system will face high internal fragmentation.
- CRandom access is efficient due to in-memory pointers.
- DAccessing each block requires following the pointer chain.
7.Which method of file allocation is most likely to suffer from external fragmentation?
- AIndexed allocation
- BContiguous allocation
- CFAT allocation
- DLinked allocation