lgf862005
Newbie level 2
Consider a file currently consisting of 60 data blocks. Assume that the file ‘() directory entry file control block (and the index block, in the case of indexed allocation) are already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single level) allocation strategies. If, for one block, the following conditions hold. In the contiguous-allocation case, assume that there is room to grow in the beginning, but there is NO room to grow in the end. Assume that the block information to be added is stored in memory. I/O required for directory, index block and FCB updates can also be ignored. In the case for linked, there are data block pointers to the last block.
a. The block is added at the beginning.
b. The block is added after the 30th block.
c. The block is added at the end.
d. The block is removed from the beginning.
e. The 30th block is removed from the file.
f. A block is removed from the end.
a. The block is added at the beginning.
b. The block is added after the 30th block.
c. The block is added at the end.
d. The block is removed from the beginning.
e. The 30th block is removed from the file.
f. A block is removed from the end.
