Operating Systems | Memory Management | Question 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.
Quiz of this Question
Recommended Posts:
- Operating Systems | Memory Management | Question 9
- Operating Systems | Memory Management | Question 10
- Operating Systems | Memory Management | Question 4
- Operating Systems | Memory Management | Question 8
- Operating Systems | Memory Management | Question 2
- Operating Systems | Memory Management | Question 10
- Operating Systems | Memory Management | Question 10
- Operating Systems | Memory Management | Question 6
- Operating Systems | Memory Management | Question 5
- Operating Systems | Process Management | Question 6
- Operating Systems | Input Output Systems | Question 5
- Operating Systems | CPU Scheduling | Question 2
- Operating Systems | CPU Scheduling | Question 1
- Overlays in Memory Management
- Program for First Fit algorithm in Memory Management
