The optimal page replacement algorithm will select the page that

GATE · 2002 · CS · Question 1 subparts

1. A.

   Has not been used for the longest time in the past.

2. B.

   Will not be used for the longest time in the future.

3. C.

   Has been used least number of times.

4. D.

   Has been used most number of times.

Attempted by 746 students.