Register

MadeEasy Subject Test: Operating System - File System

• edited by
1,659 views
0 0 votes
A unix I node has 10 direct pointers 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1 byte. If the max number of bytes of a file that can be accessed by quadruple pinter is 4 terabytes using the inode then how many bits are required to address disk bock?

a. 8

b. 16

c. 24

d. 32

 

The answer given at most places is 32.

1 Answer

0 0 votes

Given , DB size is 1 Bytes .

we need to find out number of bits in disk block address requires , let it be x bits = x/8 Bytes .

Given , max number of bytes of a file that can be accessed by quadruple pointer is 4 terabytes .

max number of bytes of a file that can be accessed by quadruple pointer =  ( DBSize / DBA )4  *  DBSize 

= {1/ (x/8 ) }4  * 1

= ( 8/x)4

( 8/x)4 = 4 TB  =  4 * 10004 byte

now find x from this equation ..

Voting & Accepting an answer helps improve the community
← Previous · 2's ComlementNext → · Matrix Multiplicatio...
← Previous in category · SchedulingNext in category → · tlb segmentation pag...
Position:
Show:

Related questions

3 3 votes
1 1 answer
1.2k
1.2k views
Anup patel asked Oct 13, 2017
1,235 views
File System - Unix Inode
4 4 votes
2 answers 2 answers
2.7k
2.7k views
reena_kandari asked Jan 29, 2017
2,655 views
file system
In particular unix OS each data block is of size 1024 bytes each node has 10 direct data blocks and 2-additional addresses one for single indirect block and one for doubl...
0 0 votes
0 0 answers
860
860 views
jatinmittal199510 asked Jan 17, 2017
860 views
File System
What all topics do we need to study from the topic ' File Systems' in Operating System for GATE ?
1 1 vote
0 0 answers
1.3k
1.3k views
saurabh rai asked Dec 26, 2016
1,337 views
Doubt regarding unix i-node file system implementation
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...