Bissoy.com
Doctors Medicines MCQs Q&A

Recall that Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1: Random page replacement algorithm (where a page chosen at random is replaced) Suffers from Belady’s anomaly S2: LRU page replacement algorithm suffers from Belady’s anomaly Which of the following is CORRECT?

Recall that Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1: Random page replacement algorithm (where a page chosen at random is replaced) Suffers from Belady’s anomaly S2: LRU page replacement algorithm suffers from Belady’s anomaly Which of the following is CORRECT? Correct Answer S1 is true, S2 is false

Concepts:

Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases.

Explanation:

S1: Random page replacement algorithm (where a page chosen at random is replaced)

Suffers from Belady’s anomaly.

Random page replacement algorithm can behave like any replacement algorithm. It may behave as FIFO, LRU, MRU etc.). When random page replacement algorithm behaves like a FIFO page replacement algorithm in that case there can be chances of belady’s anamoly.

For this let us consider an example of FIFO case, if we consider the reference string 3  2 1 0 3 2 4 3 2 1 0 4 and 3 frame slots, in this we get 9 page fault but if we increase slots to 4, then we get 10 page faults.

So, page faults are increasing by increasing the number of frame slots. It suffers from belady’s anamoly.

S2: LRU page replacement algorithm suffers from Belady’s anomaly

It doesn’t suffers from page replacement algorithm because in LRU, the page which is least recently used is replaced by the new page. Also, LRU Is a stack algorithm. (A stack algorithm is one that satisfies the inclusion property.) and stack algorithm doesn’t suffer from belady’s anamoly.

Related Questions

Fact 1: Eyeglass frames cost between $35 and $350.
Fact 2: Some eyeglass frames are made of titanium.
Fact 3: Some eyeglass frames are made of plastic.

If the first three statements are facts, which of the following statements must also be a fact?
I: Titanium eyeglass frames cost more than plastic frames.
II: Expensive eyeglass frames last longer than cheap frames.
III: Only a few eyeglass frames cost less than $35.
A virtual memory system uses FIFO page replacement policy and allocates a fixed number of frames to the process. Consider the following statements M : Increasing the number of page frames allocated to a process sometimes increases the page fault rate N : Some programs do not exhibit locality of reference Which one of the following is true?
A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements. P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate Q : Some programs do not exhibit locality of reference Which of the following is TRUE?
Consider the following page reference string: 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 Assume that there are three-page frames which are initially empty. Let LRU, FIFO, OPTIMAL denote the number of page faults under the corresponding page replacement strategy. Then, which of the following is TRUE?
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 Let a computer system has main memory size of 3 page frames which are initially empty and it is running on demand paged virtual memory system. The number of page faults under LRU and FIFO page replacement policy are respectively:
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then
Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For LRU page replacement algorithm with 4 frames, the number of page faults is?
Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For LRU page replacement algorithm with 5 frames, the number of page faults is?
Which of the following Page Replacement Algorithm suffers from the belady's anomaly?
How many page faults occur in a system with LRU page replacement policy having 3 (initially empty) page frames for the following string of page reference - 5, 1, 2, 3, 4, 3, 2, 3, 1, 2, 4, 3?