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                          

Related MCQs

• Segment replacement algorithms are more complex than page replacement algorithms because                          
• In virtual memory, which is not a page replacement algorithm ?
• In FIFO page replacement algorithm, when a page must be replaced                          
• LRU page – replacement algorithm associates with each page the              
• A FIFO replacement algorithm associates with each page the                
• What is the Optimal page – replacement algorithm?
• What is the reason for using the LFU page replacement algorithm?
• 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.
• If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is
• Which of the following page replacement algorithms suffers from Belady’s Anomaly?