Selection of page in main memory to be replaced when a new page must be brought in. Most policies try to predict future behaviour based on past behaviour. Least recently used page replacement algorithm defines as,
(A) The page for which the time to NEXT reference is longest is replaced.
(B) Pages are treated a circular list, longest resident (oldest) page is replaced.
(C) Page in the memory that has NOT been referenced for longest time is replaced.
(D) None of the above.


Answer: (C)

Explanation: Page replacement algorithms,

  • Optimal replacement algorithm: The page for which the time to NEXT reference is longest is replaced.
  • First come first serve (FIFO): Pages are treated a circular list, longest resident (oldest) page is replaced.
  • Least recently used (LRU): Page in the memory that has NOT been referenced for longest time is replaced.

So, option (C) is correct.

Quiz of this Question


  • Last Updated : 06 Dec, 2018

Share your thoughts in the comments