Operating Systems | Memory Management | Question 1

1

Which of the following page replacement algorithms suffers from Belady’s anomaly?

(A) FIFO
(B) LRU
(C) Optimal Page Replacement
(D) Both LRU and FIFO


Answer: (A)

Explanation: Belady’s anomaly proves that it is possible to have more page faults when increasing the number of page frames while using the First in First Out (FIFO) page replacement algorithm.

See the example given on Wiki Page.

GATE CS Corner    Company Wise Coding Practice

Recommended Posts:



1 Average Difficulty : 1/5.0
Based on 3 vote(s)