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.
Recommended Posts:
- Operating Systems | Memory Management | Question 10
- Operating Systems | Memory Management | Question 5
- Operating Systems | Memory Management | Question 6
- Operating Systems | Memory Management | Question 8
- Operating Systems | Memory Management | Question 9
- Operating Systems | Memory Management | Question 10
- Operating Systems | Memory Management | Question 2
- Operating Systems | Memory Management | Question 10
- Operating Systems | Memory Management | Question 4
- Operating Systems | Process Management | Question 6
- Operating Systems | Process Management | Question 6
- Operating Systems | Process Management | Question 6
- Operating Systems | Process Management | Question 6
- Operating Systems | Process Management | Question 6
- Program for buddy memory allocation scheme in Operating Systems | Set 2 (Deallocation)