Skip to content
Related Articles

Related Articles

Operating Systems | Memory Management | Question 1

View Discussion
Improve Article
Save Article
  • Difficulty Level : Basic
  • Last Updated : 03 Oct, 2019
View Discussion
Improve Article
Save Article

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.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!