Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q1061: Which of the following algorithms is used mainly for comparison purposes due to its difficulty in implementation?
- A: FIFO
- B: Optimal
- C: LRU
- D: None of the above
View Answer
B
Q1062: What is Belady's Anomaly in page replacement algorithms?
- A: Page fault rate decreases with more frames
- B: Page fault rate increases with more frames
- C: Frames allocated do not affect page faults
- D: None of the above
View Answer
B
Q1063: Which page replacement algorithm does not suffer from Belady’s Anomaly?
- A: FIFO
- B: LRU
- C: LFU
- D: MFU
View Answer
B
Q1064: Belady’s Anomaly occurs when the page fault rate _______ as the number of allocated frames increases.
- A: Decreases
- B: Increases
- C: Remains the same
- D: Is undefined
View Answer
B
Q1065: The Least Frequently Used (LFU) algorithm selects the page with the _______ reference count.
- A: Largest
- B: Smallest
- C: Average
- D: Most recent
View Answer
B
Q1066: In Least Frequently Used (LFU), pages that have been used heavily during the initial phase of a process _______.
- A: Remain in memory
- B: Are discarded immediately
- C: Are given priority
- D: Are never replaced
View Answer
A
Q1067: The Most Frequently Used (MFU) algorithm selects the page with the _______ reference count.
- A: Largest
- B: Smallest
- C: Recent
- D: None of the above
View Answer
A
Q1068: The LRU Approximation algorithm uses a _______ bit to track page references.
- A: Reference
- B: Fault
- C: Access
- D: Modified
View Answer
A
Q1069: A page replacement algorithm that uses a reference bit to track page usage is called the _______ algorithm.
- A: FIFO
- B: LRU
- C: LFU
- D: MFU
View Answer
B
Q1070: Page Buffering Algorithm helps to _______ by keeping a pool of free frames.
- A: Increase memory usage
- B: Reduce page faults
- C: Decrease CPU usage
- D: Reduce I/O operations
View Answer
B