TNPSC-2017-Polytechnic-CS
August 16, 2024CMI PHD 2022
August 16, 2024Operating-Systems
| Question 344 |
Which of the following page replacement algorithms DOES NOT suffer from Belady’s Anomaly?
| First Come First Serve | |
| LRU | |
| Most Recently Used
| |
| None of the Above |
Question 344 Explanation:
Generally, on increasing the number of frames to a process’ virtual memory, its execution becomes faster as less number of page faults occur. Sometimes the reverse happens, i.e. more number of page faults occur when more frames are allocated to a process. This most unexpected result is termed as Belady’s Anomaly.
Correct Answer: B
Question 344 Explanation:
Generally, on increasing the number of frames to a process’ virtual memory, its execution becomes faster as less number of page faults occur. Sometimes the reverse happens, i.e. more number of page faults occur when more frames are allocated to a process. This most unexpected result is termed as Belady’s Anomaly.
Subscribe
Login
0 Comments