Multiple choice

Which of thye following pages will be chosen for replacement by the Optimal Page Replacement Algorithm?

  1. Page which has been used the least number of times.

  2. Page that has not been used in the past for the longest.

  3. Page whose next use will occur farthest in the future.

  4. Page which arrived the earliest.

  5. Any page
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Optimal page replacement policy is an algorithm that works as follows: when a page needs to be swapped in, the operating system swaps out the page whose next use will occur farthest in the future. For example, a page that is not going to be used for the next 6 seconds will be swapped out over a page that is going to be used within the next 0.4 seconds.

Keep practicing — related questions