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.
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
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
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
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!