Multiple choice

Which of the following page replacement algorithms suffer(s) from Belady's Anomaly?

  1. LRU

  2. FIFO

  3. Optimal replacement

  4. Both 1 and 3
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Belady's Anomaly refers to the phenomenon where increasing the number of page frames results in an increase in the number of page faults for certain memory access patterns. This is a well-known characteristic of the First-In-First-Out (FIFO) algorithm. LRU and Optimal replacement do not suffer from this anomaly.

Keep practicing — related questions