Which of the following page replacement algorithms(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.
- AOnly I
- BNeither I nor II
- COnly II
- DBoth I and II
Correct answer: A