When using counters to implement LRU, we replace the page with the                          

Related MCQs

• LRU page – replacement algorithm associates with each page the              
• What are the two methods of the LRU page replacement policy that can be implemented in hardware?
• 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.
• LRU stands for                        
• For larger page tables, they are kept in main memory and a                      points to the page table.
• In FIFO page replacement algorithm, when a page must be replaced                          
• In question 2, if the number of page frames is increased to 4, then the number of page transfers                          
• 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                          
• A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because                          
• When a web page is loading, and the user presses a button on the browser to stop loading the page?