Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Suppose a demand paged virtual memory system running on…
Consider a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Suppose a demand paged virtual memory system running on a computer system such that the main memory has 3 page frames. Then.............. page replacement algorithm has minimum number of page faults.
Show answerHide answer
Correct answer: (D) Optimal
Explanation
For this reference string with 3 frames, the optimal algorithm gives 9 page faults, fewer than FIFO, LIFO or LRU. So the optimal algorithm has the minimum number of page faults.