Operating Systems | Memory Management | Question 1

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

(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

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

My Personal Notes arrow_drop_up