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