GATE | GATE-CS-2002 | Question 23
The optimal page replacement algorithm will select the page that
Has been used least number of times.
Will not be used for the longest time in the future.
Has not been used for the longest time in the past.
Has been used most number of times.
The optimal page replacement algorithm will select the page whose next occurrence will be after the longest time in future. For example, if we need to swap a page and there are two options from which we can swap, say one would be used after 10s and the other after 5s, then the algorithm will swap out the page that would be required 10s later.
Thus, B is the correct choice.
Quiz of this Question
Please comment below if you find anything wrong in the above post
My Personal Notes arrow_drop_up
Please Login to comment...