531,076 views
13 votes
13 votes
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 four frames, how many page faults would occur for the following replacement algorithms?

User Witold Kaczurba
by
2.7k points

1 Answer

11 votes
11 votes

Answer:

Explanation:

User Zifot
by
2.9k points