Consider the following page reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2. How many
Posted: Sat May 14, 2022 6:51 pm
Consider the following page reference string:
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4,
2.
How many page faults would occur for the following replacement
algorithms, assuming one, three, and five farms? Remember
that all frames are initially empty, so your first unique pages
cost one fault each.
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4,
2.
How many page faults would occur for the following replacement
algorithms, assuming one, three, and five farms? Remember
that all frames are initially empty, so your first unique pages
cost one fault each.