Optimal page replacement algorithm - Operating System - not used for the longest time in future.

Q.  Operating System: The optimal page replacement algorithm will select the page that
- Published on 19 Oct 15

a. has been used least number of times.
b. has been used most number of times.
c. has been used for the longest time in the past.
d. will not be used for the longest time in future.

ANSWER: will not be used for the longest time in future.

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 23 Nov 15
    - An optimal page replacement algorithm produces the lowest page fault rate of all algorithms.

    - The algorithm is to replace the page that will not be used for the longest period of time to come.

    - Given a fixed number of memory frame by allocation, the algorithm always guarantees the lowest possible page fault rate and does not suffer from Belady's anamoly.

    - Replace the page that will not be used for the longest period of time in future.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲