Question: Consider the following page reference string: 1, 2, 5, 4, 2, 3, 5, 2, 4, 5, 2, 2, 1, 2 How many page faults would
Consider the following page reference string:
1, 2, 5, 4, 2, 3, 5, 2, 4, 5, 2, 2, 1, 2
How many page faults would occur for LRU, MFU, LFU, FIFO and Optimal Page replacement algorithms if there are 3 frames? Initially, all frames are empty.
In the same number order.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
