The _________ policy results in the fewest number of page faults.
A) Optimal
B) FIFO
C) Clock
D) LRU

Question

Quizplus · Accepted Answer

The Optimal policy, also known as the Belady's algorithm, results in the fewest number of page faults because it replaces pages that will not be used for the longest period of time. However, this policy requires knowledge of the future page requests, which is not feasible in most practical scenarios.

The _________ Policy Results in the Fewest Number of Page