Please log in or register to add a comment.
edited by
8,827 views
20 votes
20 votes

In which one of the following page replacement policies, Belady's anomaly may occur?

  1. FIFO
  2. Optimal
  3. LRU
  4. MRU
edited by

5 Answers

Best answer
11 votes
11 votes
Answer : A) FIFO

How/Why?
Page Replacement algorithms suffer from Belady’s anamoly if :

  • They do not follow the stack based algorithm.

Reference :-

Since MRU, LRU & Optimal Replacement Algo follow Stack Algo, hence they are not affected by Belady's Anamoly.

selected by
0 votes
0 votes
Option:( A) FIFO

Belady's anomaly is the problem which occur when we increase the frame size and still the page fault increases
Answer:

Related questions

50.3k
views
18 answers
128 votes
Kathleen asked Sep 22, 2014
50,307 views
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be ... $I=3$I=4$I=5$
21.0k
views
7 answers
34 votes
Kathleen asked Sep 22, 2014
21,014 views
$S \to aSa \mid bSb\mid a\mid b$The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of:all palindromesall odd length palindromesstrings that begin and end with the same symbolall even length palindromes
8.5k
views
4 answers
5 votes
habedo007 asked Jul 5, 2016
8,518 views
Determine the number of page faults when references to pages occur in the following order:1, 2, 4, 5, 2, 1, 2, 4Assume that the main memory can ... having brought earlier than page 2. (LRU page replacement algorithm is used)354None of these
6.5k
views
2 answers
7 votes
Desert_Warrior asked Jul 3, 2016
6,501 views
Working Set $(t,k)$ at an instant of time $t$ isthe set of $k$ future references that the OS will makethe set of future references that the OS will make ... frequencythe $k$ set of pages that have been referenced in the last $t$ time units