Ask Question

Consider the following page reference string:

7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1.

Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms?

(a) LRU replacement

(b) FIFO replacement

(c) Optimal replacement

+2
Answers (1)
  1. 8 January, 20:48
    0
    a) 18

    b) 17

    c) 13
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1. Assuming demand paging with three ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers