1 votes 1 votes Which of the following Page Replacement Algorithm suffers from the belady’s anomaly? $LRU$ Optimal Page Replacement $FIFO$ Both $LRU$ and $FIFO$ Unknown Category nielit-scb-2020 + – gatecse asked Dec 9, 2020 • edited Dec 12, 2020 by soujanyareddy13 gatecse 416 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Belady anomaly : pagefault increases when we increase the alloted frames. FIFO and it's related algorithm suffers with belady anomaly. Shaik Masthan answered Dec 9, 2020 Shaik Masthan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Belady Anomaly: Normally when we increasing the frame size page fault will be decreasing but in belady anomaly when we increasing frame size page fault is also increase. according to the given choice, FIFO is suffering from belady anomaly. Option C is correct. GATE2017-1-40 GATE2009-9, ISRO2016-52 GATE1995-1.8 Hira Thakur answered Dec 11, 2020 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.