Which of the following page replacement algorithms suffers from Belady’s Anomaly?

Related MCQs

• Segment replacement algorithms are more complex than page replacement algorithms because                          
• There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called                          
• In FIFO page replacement algorithm, when a page must be replaced                          
• 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                          
• LRU page – replacement algorithm associates with each page the              
• If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order            bits of a logical address designate the page number, and the          low order bits designate the page offset.
• In virtual memory, which is not a page replacement algorithm ?
• A FIFO replacement algorithm associates with each page the                
• What is the Optimal page – replacement algorithm?
• What are the two methods of the LRU page replacement policy that can be implemented in hardware?