18.6k views
0 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?

1 Answer

4 votes

Answer:

Explanation:

User Idstam
by
5.5k points