BPSC TRE – OS: File Systems, Disk Scheduling & I/O | Test 1

Questions 1-5 of 50

0% completed (0/50 answered)
Your score 0/50 0 answered
Correct 0 Incorrect 0 Unanswered 50 Accuracy 0%

Question 1

MCQ · Single Correct 1 mark

Which file access method reads records in order, one after another, and is the most common mechanism used by traditional magnetic tape systems?

Answers for question 1

Question 2

MCQ · Single Correct 1 mark

In UNIX/Linux file systems, which metadata data structure stores all essential file details such as file size, ownership, permissions, and block pointers, EXCEPT the filename itself?

Answers for question 2

Question 3

MCQ · Single Correct 1 mark

Which file allocation method allows fast random access to any block without external fragmentation, but incurs overhead due to dedicated index blocks?

Answers for question 3

Question 4

MCQ · Single Correct 1 mark

What major drawback is associated with Contiguous File Allocation?

Answers for question 4

Question 5

MCQ · Single Correct 1 mark

In a UNIX inode structure with 12 direct pointers, 1 single indirect, 1 double indirect, and 1 triple indirect pointer, if block size is 4 KB and disk address is 4 bytes, what is the maximum file size accessible directly via the 12 direct pointers?

Answers for question 5
Scroll to Top