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

Article Tags :

Operating Systems

memory-management

Operating Systems-Memory Management

Recommended Articles

1. Operating Systems | Memory Management | Question 2

2. Operating Systems | Memory Management | Question 10

3. Operating Systems | Memory Management | Question 4

4. Operating Systems | Memory Management | Question 5

5. Operating Systems | Memory Management | Question 6

6. Operating Systems | Memory Management | Question 10

7. Operating Systems | Memory Management | Question 8

8. Operating Systems | Memory Management | Question 9

9. Operating Systems | Memory Management | Question 10

10. Operating Systems | Input Output Systems | Question 5

11. Memory Protection in Operating Systems

12. Operating Systems | Process Management | Question 6

13. Operating Systems | Process Management | Question 6

14. Operating Systems | Process Management | Question 6

15. Best Ways for Operating System Memory Management

16. Memory Management in Operating System

17. Operating Systems | CPU Scheduling | Question 1

18. Operating Systems | CPU Scheduling | Question 2

19. Difference between Volatile Memory and Non-Volatile Memory

20. Random Access Memory (RAM) and Read Only Memory (ROM)

21. Difference between Virtual memory and Cache memory

22. Why Linked List is implemented on Heap memory rather than Stack memory?

23. Levels of Memory in Operating System

24. Virtual Memory in Operating System

25. Operating Systems - GATE CSE Previous Year Questions