1,252 views

1 Answer

0 0 votes
Each i-node has a total 15 block addresses which means 15 bit block addresses.
So each i-node size = (2^15)B.

Now let’s see how many i-nodes are required to address the entire disk space, i.e.512 GB

= Total Size / I-node Size

= 512 GB/ (2^15)B

= (2^39)/(2^15)

= 2^24

So ‘24’ bits are required to address the entire disk space which is equal to 3 Bytes.
That means Block Entry Size= 3 Bytes

Now to support file size up to 1 GB, we need to calculate the number of i-node or blocks required,

= File Size/ I-node Size

= 1 GB/ (2^15)B

= (2^30)/(2^15)

=2^15

Now to address 2^15 block we need a space = No_of_blocks * Block_Entry_Size = (2^15)*3 Bytes

Now question says to find out this space in units of block addresses, So just divide by 1 block size.

= (2^15)*3 / (2^15) = 3 = 3 block addresses
• edited by
Position:
Show:

Related questions

1 1 vote
0 0 answers
1.2k
1.2k views
Shubhanshu asked Sep 5, 2017
1,241 views
Explain the following terms with there respective formula (expression)1) Max file size2) Max possible file size3) Max Disk Size4) Total file size5) max possible size of t...
1 1 vote
0 0 answers
1.4k
1.4k views
saurabh rai asked Dec 26, 2016
1,368 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...
3 3 votes
2 2 answers
12.3k
12.3k views
khushtak asked Jan 6, 2016
12,328 views
Consider a file system that uses UNIX like inodes to keep track of the sectors allocated to files. Assume that disk blocks are 1 KB in size, disk block addresses are 32 b...
3 3 votes
2 2 answers
4.1k
4.1k views
Shubhanshu asked Aug 16, 2017
4,052 views
Q1 Consider the Unix file node which maintains 12 direct disk block addresses, 1 single indirect, 1 double indirect, and 1 triple indirect disk block addresses. The disk ...