[Solved]1 Consider Following Page Reference String 2 1 5 6 2 1 2 1 7 6 3 2 1 2 3 6 Using Table Ans Q37242049

1. Consider the following page reference string: 2, 1,5, 6, 2, 1, 2, 1, 7, 6, 3, 2, 1, 2, 3, 6 (using the belowtable Answer the followingquestions.)

Further assume that there are four frames in the system, whereall of the frames are initially empty.

(a) For the LRU (Least Recently Used) page replacementalgorithm, fill the table where each column represents the framesafter each page reference.(Note that the last row is the referencestring.) Then specify how many page faults it generates. Mark allthe references that generate a page fault with “*”.

(b)For the Belady’s optimal page replacement algorithm, fill thetable where each column represents the frames after each pagereference. (Note that the last row is the reference string.) Thenspecify how many page faults it generates. Mark all the referencesthat generate a page fault with “*”.

(c) For the working set page replacement algorithm with a windowof size 4, fill the table where each column represents the framesafter each page reference. (Note that the last row is the referencestring.) Then specify how many page faults it generates. Mark allthe references that generate a page fault with “*”.

(d) Based on the number of page faults for each algorithm forthis page reference string, is that possible to calculate the pagefault rate per memory reference? Justify your answer.

21562121763212 36 Show transcribed image text 21562121763212 36

Expert Answer

---

Answer to 1. Consider the following page reference string: 2, 1, 5, 6, 2, 1, 2, 1, 7, 6, 3, 2, 1, 2, 3, 6 (using the below table A… . . .