Start learning 50% faster. Sign in now
The Least Recently Used (LRU) page replacement algorithm replaces the page that has not been used for the longest time. It can be implemented efficiently using a hash map and a doubly linked list or queue. The hash map is used to store the pages, and the linked list is used to track the most recently used pages. This ensures O(1) time complexity for both the lookup and replacement operations. Option A (Replaces the page that has been in memory the longest): This is incorrect. LRU replaces the least recently used page, not the one that has been in memory the longest. Option C (Replaces the page that has been accessed the least): LRU doesn’t replace the least accessed page; it replaces the least recently used page. A page could be accessed frequently but not recently. Option D (Causes high page fault rates in large systems): While LRU does result in page faults, it is no worse than other algorithms. In fact, LRU minimizes page faults compared to algorithms like FIFO. Option E (Less efficient than FIFO): LRU is generally more efficient than FIFO as it better tracks page usage history, whereas FIFO might replace a page that is frequently used but just older in the queue.
Which state ranks first among all the Indian states in terms of Angiosperm diversity?
Yellow mosaic in soybean is spread by:
International Rural Women day is celebrated on ………………
…………is a pretreatment of seeds that aims to break seed dormancy through puncturing, burning, breaking, filing, and scratching with knives, nee...
Price elasticity of supply of food products is generally
Which soil is most suitable for groundnut cultivation?
Toxins present in Rape seed and Mustard oil is
Selfing reduces heterozygosity by what ratio in each generation:
Which rock is an example of a clastic sedimentary rock?
What does the law of demand state in agricultural economics?