UTpaper

Free mock tests & test series

Question 162Asked in DSSSB TGT Computer Science, 7 Feb 2024, Shift 2 (12:30 PM)

Which of the following page replacement algorithms(s) does not suffer from Belady’s

Which of the following page replacement algorithms(s) does not suffer from Belady’s anomaly in Operating System? I. Least-Recently Used (LRU) page replacement. II. First-In, First-Out (FIFO) page replacement.
  1. AOnly I
  2. BNeither I nor II
  3. COnly II
  4. DBoth I and II
Show answerHide answer

Correct answer: (A) Only I

Explanation

LRU is a stack algorithm and never suffers from Belady's anomaly. FIFO can give more page faults with more frames, so it does suffer from it.

From DSSSB TGT Computer Science PYQ, 7 Feb 2024, Shift 2 (12:30 PM)

This is question 162 of DSSSB TGT Computer Science PYQ, 7 Feb 2024, Shift 2 (12:30 PM). 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.