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