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.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.