LRU (Least Recently Used)

- LRU (Least Recently Used) is an algorithm used in computer memory management to determine which pages should be replaced when the system needs to free up memory.
- In this algorithm, the page that has not been accessed for the longest period of time is removed first.
- LRU algorithm assumes that the pages that have been accessed recently are more likely to be accessed in the near future, while the pages that haven't been accessed for a long time are less likely to be accessed again.

MRU (Most Recently Used)

- MRU (Most Recently Used) is an algorithm that removes the most recently used page first.
- This algorithm assumes that the recently used pages are more likely to be accessed again in the near future.
- When a page is accessed, it is moved to the front of the list, indicating that it has been recently used.
- When the system needs to remove a page, it removes the one at the end of the list, which is the least recently used.

Comparison

- The LRU algorithm removes the page that has not been accessed for the longest time, while the MRU algorithm removes the page that has been accessed most recently.
- LRU takes into account the historical usage of pages, while MRU focuses on the recent usage of pages.
- LRU is more suitable for scenarios where frequently accessed pages tend to be accessed again, while MRU is more suitable for scenarios where recently accessed pages are likely to be accessed again.

Correct answer

- The correct answer for the given question is option 'B' (MRU - Most Recently Used).
- The algorithm mentioned in the question removes the recently used page first, which aligns with the behavior of the MRU algorithm.
- Therefore, the correct answer is MRU.