Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q1231: What is a key feature of a bit vector in free-space management?
- A: It links free blocks in a list
- B: It maps each block to a 1 or 0 based on its availability
- C: It keeps track of file metadata
- D: It allocates new files directly
View Answer
B
Q1232: Free space in a file system can be managed using a _________.
- A: File Allocation Table (FAT)
- B: Bit vector
- C: Multi-level index
- D: Disk schedule
View Answer
B
Q1233: Which free-space management technique uses a linked list to manage free blocks?
- A: Bit vector
- B: Linked list
- C: Grouping
- D: Counting
View Answer
B
Q1234: A block in the UNIX system’s file manager can hold up to ________ direct pointers.
- A: 10
- B: 15
- C: 20
- D: 25
View Answer
A
Q1235: A double indirect block pointer in UNIX file systems refers to which of the following?
- A: Points to data blocks directly
- B: Points to a block containing addresses of blocks that contain data
- C: Points to file metadata
- D: Points to an indirect block pointer
View Answer
B
Q1236: Which disk scheduling algorithm is most efficient in terms of minimizing seek time?
- A: FCFS
- B: SSTF
- C: C-SCAN
- D: C-Look
View Answer
B
Q1237: In the UNIX file system, the maximum file size depends on the size of ________.
- A: Inode block size
- B: Disk addresses
- C: File Allocation Table
- D: Directory entry
View Answer
B
Q1238: The best-case I/O operations for inserting a block after the 50th block will be ________.
- A: 100+1+2
- B: 50+1+2
- C: 50+1+100
- D: 103+2
View Answer
A
Q1239: The process of linking free blocks together in memory for disk management is known as ________.
- A: Free list linking
- B: Counting
- C: Grouping
- D: Bit vectoring
View Answer
A
Q1240: The approach of maintaining free blocks by storing the addresses of n free blocks in the first free block is called ________.
- A: Bit vector
- B: Linked list
- C: Grouping
- D: Counting
View Answer
C