Operating Systems | Memory Management | Question 1
Which of the following page replacement algorithms suffers from Belady’s anomaly?
(C) Optimal Page Replacement
(D) Both LRU and FIFO
Explanation: Belady’s anomaly proves that it is possible to have more page faults when increasing the number of page frames while using the First in First Out (FIFO) page replacement algorithm.