Question
a.
Optimal replacement
b.
LRU
c.
FIFO
d.
Both optimal replacement and FIFO
Posted under Linux System Operating System
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which of the following page replacement algorithms suffers from Belady’s Anomaly ?
Similar Questions
Discover Related MCQs
Q. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is :
View solution
Q. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is :
View solution
Q. Users _______ that their processes are running on a paged system.
View solution
Q. If no frames are free, _____ page transfer(s) is/are required.
View solution
Q. When a page is selected for replacement, and its modify bit is set :
View solution
Q. The aim of creating page replacement algorithms is to :
View solution
Q. A FIFO replacement algorithm associates with each page the _______
View solution
Q. Optimal page – replacement algorithm is :
View solution
Q. Optimal page – replacement algorithm is difficult to implement, because :
View solution
Q. LRU page – replacement algorithm associates with each page the ______
View solution
Q. The two methods how LRU page replacement policy can be implemented in hardware are:
View solution
Q. When using counters to implement LRU, we replace the page with the :
View solution
Q. In the stack implementation of the LRU algorithm, a stack can be maintained in a manner :
View solution
Q. There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called :
View solution
Q. The essential content(s) in each entry of a page table is / are :
View solution
Q. The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by :
View solution
Q. The reason for using the LFU page replacement algorithm is :
View solution
Q. The reason for using the MFU page replacement algorithm is :
View solution
Q. The implementation of the LFU and the MFU algorithm is very uncommon because :
View solution
Q. The minimum number of frames to be allocated to a process is decided by the :
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
