Which of the following page replacement algorithm(s) does not suffer from…
2024
Which of the following page replacement algorithm(s) does not suffer from Belady's anomaly in Operating System? I. Least-Recently Used (LRU) page replacement. II. First-In, First-Out (FIFO) page replacement.
- A.
Only I
- B.
Neither I nor II
- C.
Only II
- D.
Both I and II
Attempted by 125 students.
Show answer & explanation
Correct answer: A
LRU page replacement is a stack algorithm and does not suffer from Belady's anomaly. FIFO can suffer from Belady's anomaly, so only statement I is correct.