GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

The optimal page replacement algorithm will select the page that

A

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

B

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

C

Has been used least number of times.

D

Has been used most number of times.

asked in Memory management and virtual memory by gate

1 Answer

0 votes
Will not be used for the longest time in the future.
answered by gate

Related questions

The best answer to any question