File System Interface and Implementation Questions and Answers

Q: Which of the following is the main purpose of the File System in an operating system ?

The file system's main purpose is to provide a structured way to store and access data.A file system organises data on storage devices into named files and directories, keeps track of where each file's blocks are, and controls access, so programs and users can store and retrieve data by name.Memory allocation, CPU scheduling and peripheral control are the jobs of the memory manager, the process scheduler and the device manager.

Q: Which file allocation method provides best access time for sequential access ?

The method is contiguous allocation.In contiguous allocation a file occupies consecutive blocks on the disk, so reading it in order needs little or no head movement between blocks. Any block can also be located directly from the start address and length. Both sequential and direct access are as fast as they can be.Linked allocation scatters blocks and has to follow pointers one by one. Indexed allocation needs index block lookups, and its data blocks may also be scattered. Hashed allocation is a way of organising directories, not a file block allocation method.

Q: Which file organization allows fastest direct access ?

The fastest direct access comes from hashing.In a hashed (direct) file, a hash function turns the record key straight into the address where the record is stored, so a record can usually be reached in a single access without searching.A sequential file must be read from the start until the record is found. An indexed file first looks the key up in an index and then goes to the record, which takes extra accesses. Linked organisation follows pointers from record to record, which is slower still.

11.

Which of the following is the main purpose of the File System in an operating system ?

A.Manage memory allocation
B.Manage CPU scheduling
C.Provide a structured way to store and access data
D.Control peripheral devices

Exam Year(s)

Tripura Public Service Commission - 2025,

Answer: C

The file system's main purpose is to provide a structured way to store and access data.

A file system organises data on storage devices into named files and directories, keeps track of where each file's blocks are, and controls access, so programs and users can store and retrieve data by name.

Memory allocation, CPU scheduling and peripheral control are the jobs of the memory manager, the process scheduler and the device manager.

Discuss in Forum

12.

Which file allocation method provides best access time for sequential access ?

A.Contiguous allocation
B.Linked allocation
C.Indexed allocation
D.Hashed allocation

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: A

The method is contiguous allocation.

In contiguous allocation a file occupies consecutive blocks on the disk, so reading it in order needs little or no head movement between blocks. Any block can also be located directly from the start address and length. Both sequential and direct access are as fast as they can be.

Linked allocation scatters blocks and has to follow pointers one by one. Indexed allocation needs index block lookups, and its data blocks may also be scattered. Hashed allocation is a way of organising directories, not a file block allocation method.

Discuss in Forum

13.

Which file organization allows fastest direct access ?

A.Sequential
B.Indexed
C.Hashing
D.Linked

Exam Year(s)

Tripura Public Service Commission - 2026,

Answer: C

The fastest direct access comes from hashing.

In a hashed (direct) file, a hash function turns the record key straight into the address where the record is stored, so a record can usually be reached in a single access without searching.

A sequential file must be read from the start until the record is found. An indexed file first looks the key up in an index and then goes to the record, which takes extra accesses. Linked organisation follows pointers from record to record, which is slower still.

Discuss in Forum

14.

How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ?

A.332.8 KB
B.83.6 KB
C.266.2 KB
D.256.6 KB

Exam Year(s)

UGC NET - 2013,

Answer: A

The bit map needs one bit per block. The number of blocks is the disk size divided by the block size, and the space is that number of bits converted to bytes.

\[ \frac{1.3 \times 2^{30}}{2^{9}} = 1.3 \times 2^{21} \]\[ 1.3 \times 2^{18} \approx 340{,}787 \text{ bytes} \]\[ 340{,}787 / 1024 \approx 332.8 \text{ KB} \]

So 332.8 KB is right. The other figures are not near 1.3 x 2^18 bytes, and they would arise from mistakes in converting units.

Discuss in Forum

15.

The directory structure used in Unix file system is called

A.Hierarchical directory
B.Tree structured directory
C.Directed acyclic graph
D.Graph structured directory

Exam Year(s)

UGC NET - 2013,

Answer: C

The directory structure used in the Unix file system is a directed acyclic graph. Unix allows a file to have several links, so one file can appear in more than one directory, but cycles are not permitted. This is more general than a plain tree, where each file has a single parent.

A hierarchical or tree structured directory does not allow sharing of files through links, and a general graph structure would allow cycles, which Unix does not allow.

Discuss in Forum

Loading…

Topics

Other Subjects

Tags: File System Interface and Implementation Questions and Answers || File System Interface and Implementation MCQ Questions and Answers || File System Interface and Implementation GK Questions and Answers || File System Interface and Implementation GK MCQ Questions || File System Interface and Implementation Multiple Choice Questions and Answers || File System Interface and Implementation GK || GK on File System Interface and Implementation || Operating Systems Questions and Answers || Operating Systems MCQ Questions and Answers || Operating Systems GK Questions and Answers || GK on Operating Systems

File System Interface and Implementation Questions and Answers

Topics

Other Subjects

About Us

Stay informed about all important Dates & Notifications