491 views
1 votes
1 votes
Consider a file currently consisting of 100 blocks. Assume that the filecontrol
block (and the index block, in the case of indexed allocation)
is 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 no room to grow at
the beginning but there is room to grow at the end. Also assume that
the block information to be added is stored in memory.
a. The block is added at the beginning.
b. The block is added in the middle.
c. The block is added at the end.
d. The block is removed from the beginning.
e. The block is removed from the middle.
f. The block is removed from the end.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
ajaysoni1924 asked Mar 22, 2019
253 views
Consider a system that supports the strategies of contiguous, linked,and indexed allocation. What criteria should be used in deciding whichstrategy is best utilized for a...
0 votes
0 votes
0 answers
3
ajaysoni1924 asked Mar 22, 2019
149 views
Why must the bit map for file allocation be kept on mass storage, ratherthan in main memory?
0 votes
0 votes
0 answers
4
ajaysoni1924 asked Mar 22, 2019
212 views
What problems could occur if a system allowed a file system to bemounted simultaneously at more than one location?