Consider a file currently consisting of 200 blocks. Assume that the file
control 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. Assume
that each disk I/O operation accesses only one block. In the contiguous
allocation case, there is no room to grow in the beginning, but there is room
to grow in the end. Moreover, the block information to be added is already
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.
有點亂請見諒
看過幾次這種題目
但有些答案不一至
要不然就沒答案
對這種題目還不是很有把握
沒把握就是拿不到分
請大家幫忙一下了
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.216.9.229