推 mqazz1:謝謝 08/01 10:34
pointer 代表的記憶體空間
10 direct pointers : 10 * 512 bytes (直接指到10個block)
假設這邊存放單位都是以blcok為基本單位，
所以一個block可存放512/4 = 128 pointers
1 indirect pointer : 1 * 128 * 512 bytes
(先指到一個存指標的地方，再分別指到block)
1 double pointer : 1 * 128 * 128 * 512 bytes
1 triple pointer : 1 * 128 * 128 * 128 * 512 bytes
就這樣啦! 自己在化簡一下，主要看最大的那個就知道了!
2^7 * 2^7 * 2^7 * 2^9 = 2^30
所以三個最接近的答案選 C
※ 引述《mqazz1 (無法顯示)》之銘言：
: consider an inode-like disk-space allocation scheme. An inode is of 10 direct
: pointers, 1 indirect pointer, 1 double indirect pointer, and 1 triple indirect
: pointer. One pointer references one disk block, which is 512 bytes.
: Let one pointer be 4 bytes. Which one of the following is the smallest file
: size that is too large to be managed by this allocation scheme?
: (A) 2^8 bytes
: (B) 2^16 bytes
: (C) 2^32 bytes
: (D) None of the above
: 答案(C) 請問這個要怎麼算?
: 謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.112.233.152