Back to the 2025 paper

Module 5: Memory Management

20252m

Which page replacement algorithm replaces the page that will not be used for the longest period in the future?

(i) Optimal
(ii) Second Chance
(iii) FIFO
(iv) NRU

Worked SolutionAI Assisted

Answer: (i) Optimal

Optimal (Belady's) replaces page farthest in future — theoretically minimal faults but requires future knowledge, so not realizable; used as benchmark. Approximated by LRU.

Similar questions

AI LearningWeb Platform

Coursify — Personal AI Course Generator

Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.