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.118.110.186