Question: Consider the following page reference string: 5, 3, 7, 5, 3, 6, 1, 0, 4, 6, 2, 0, 1, 2, 7, 3, 1, 4, 7,
Consider the following page reference string: 5, 3, 7, 5, 3, 6, 1, 0, 4, 6, 2, 0, 1, 2, 7, 3, 1, 4, 7, 2. Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? LRU replacement FIFO replacement Optimal replacement
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
