• edited by
6,032 views
4 4 votes
Consider the organization of a UNIX file as represented by the inode

Assume that there are 12 direct block pointers, and a singly, doubly, and triply indirect

pointer in each inode. Further, assume that the system block size and the disk sector

size are both 8KB. If the disk block pointer is 32 bits, with 8 bits to identify the physical

disk and 24 bits to identify the physical block, then

a. What is the maximum file size supported by this system?

B. Assuming no information other than that the file inode is already in main mem-

ory, how many disk accesses are required to access the byte in position 13,423,956?

1 Answer

1 1 vote
a)No of block address a block can contain $\frac{8\times 2^{10}\times 8}{2^{5}}=2^{11}$B

So, max file size supported by the system $1\times 2^{11}\times 2^{11}\times 2^{11}\times 8\times 2^{10}$B

                                                              $=2^{46}$B

b)As $=2^{46}> 13423956$ , So 1 disk access is enough to access the byte in position 13,423,956
Position:
Show:

Related questions

0 0 votes
0 0 answers
991
991 views
Aboveallplayer asked Dec 31, 2016
991 views
consider a unix file system impleneted with i-node,that resides on a disk of size 512GB.Each i-node has atotal of 15 block addresses,consisting of direct and indirect bl...
1 1 vote
0 0 answers
1.4k
1.4k views
saurabh rai asked Dec 26, 2016
1,374 views
While solving gate previous year questions on unix i-node file system implementation many people having doubt like....."Depending on the size of the file the file will be...
1 1 vote
0 0 answers
830
830 views
srestha asked Jan 17, 2018
830 views
how 3 could be ans?
3 3 votes
1 1 answer
1.3k
1.3k views
Anup patel asked Oct 13, 2017
1,256 views