作者polomoss (小澤)
看板Grad-ProbAsk
標題[理工] [OS]-Disk
時間Tue Jan 19 22:43:21 2010
Consider a file currently consisting of 100 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,
if, for one block, the following conditions hold.
In the contiguousallocation case, assume that there is no room to grow in
the beginning, but there is room to grow in the end. 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.
可以請問這一題如何解嗎?? 有答案但是看不懂.....
--
┌這篇文章讓您覺得？─────────────────────────────┐
│ │
│ 一"一 \ / >\\\< ╯ ╰ ∩ ∩ ▁ ▁ ＞＿＜ ㄧ ㄧ+ │
│ 皿 ε □ ▽ ▇Δ ▇ ╰╯ ╯ │
│ 北七 亂喔 害羞 莎笅 爽啦 哭爸 ＸＤ 科科 │
└──────────────────────────────────────┘
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.116.14.2
→ chris750630:可以先問一下答案是啥嘛 >__<" 01/19 23:01
推 assassin88:I/O operations are required? 不明瞭他要什麼.. 01/19 23:49
→ polomoss:這題中山考過一次，又是恐龍習題~~ 01/19 23:51
推 imnewlegend:這不是基本題嘛= = 各位不是年要考吧? 01/20 03:59
推 eric111043:怎麼計算啊?我也看不懂 01/20 17:57
→ polomoss:.....說是基本題又不教一下.....就是看不懂才問阿@@ 01/20 23:07
→ imnewlegend:好兇... 01/20 23:14
推 ck1115:沒有人可以解答嗎? 看不懂 02/01 14:24