UTpaper

Free mock tests & test series

Question 57Asked in DSSSB TGT Computer Science (Technical), 1 Aug 2021, Shift 3

Which page replacement algorithm has Belady's anomaly?

  1. AOptimal page replacement
  2. BFIFO page replacement
  3. CLeast recent used page replacement
  4. DNot recently used page replacement
Show answerHide answer

Correct answer: (B) FIFO page replacement

Explanation

In FIFO, increasing the number of frames can increase page faults for some reference strings (Belady's anomaly). Optimal and LRU are stack algorithms and do not suffer from it.

From DSSSB TGT Computer Science PYQ (Technical), 1 Aug 2021, Shift 3

This is question 57 of DSSSB TGT Computer Science PYQ (Technical), 1 Aug 2021, Shift 3. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.