Consider a file currently consisting of 50 blocks. Assume that the file control block and the index block is already in memory. If a block is added at the…
Consider a file currently consisting of 50 blocks. Assume that the file control block and the index block is already in memory. If a block is added at the end (and the block information to be added is stored in memory), then how many disk I/O operations are required for indexed (single-level) allocation strategy?
Show answerHide answer
Correct answer: (A) 1
Explanation
The file control block and the index block are already in memory, so for indexed allocation only the new block has to be written to disk: 1 disk I/O operation. (Contiguous and linked allocation would need 1 and 3 operations respectively in this scenario, per the book.)