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

Consider the following page reference string:
1,2,3,4,5,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.
How many page faults would occur for the following replacement algorithms, assuming three and five frames? Remember all frames are initially empty, so your first unique pages will all cost one page fault each. Please draw the page replacement table.
a. FIFO replacement
b. LRU replacement
c. Optimal replacement

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!