Question: Consider the following page reference string: 1, 2, 3, 4, 7, 1, 5, 6, 2, 1, 4, 3, 2, 1, 2, 3, 6, 7, How

Consider the following page reference string: 1, 2, 3, 4, 7, 1, 5, 6, 2, 1, 4, 3, 2, 1, 2, 3, 6, 7, How many page faults would occur for both the LRU and FIFO replacement algorithm assuming a SIX frame working set? (yes, you have seen this seq before)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
