Which page replacement algorithm replaces the page that will not be used for the longest period of time in the future?
Options
- A. FIFO
- B. LRU
- C. Optimal
- D. More than one of the above
- E. None of the above
Quiz Practice:
C. Optimal
Explanation: The Optimal Page Replacement algorithm replaces the page whose next reference is farthest in the future. It produces the minimum possible number of page faults for a given reference string, but it is generally not implementable in practice because future references are not known in advance.