Which of the following page replacement algorithms suffers from Belady’s anamoly?
Both (A) and (C)
Proof that LRU does not incur Belady’s anomaly but that FIFO does incur the anomaly: http://ranger.uta.edu/~weems/NOTES5314/HW/hw3.3.pdf
Answer is (C).
FIFO sufferes from Belady's anomaly. Optimal replacement never suffers from Belady's anomaly.
Page Replacement algorithms suffer from Belady’s anamoly if :
Since LRU & Optimal Replacement Algo follow Stack Algo, hence they are not affected by Belady's Anamoly.
following link is Kvs_Pgt_Question Paper...