Numerical Solved by Least Recently Used Page Replacement Algorithm

Q1. If the reference string is

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3,

we have taken the physical memory of three frames, then solve by Least Recently Used Page Replacement Algorithm.

Ans.

7 0 1 2 0 3 0 4 2 3 0 3
Frame1 7 7 7 2 2 2 2 4 4 4 0 0
Frame2 0 0 0 0 0 0 0 0 3 3 3
Frame3 1 1 1 3 3 3 2 2 2 2
Faults + + + + + + + + +

Page Fault = 9 (better than FIFO)

One thought on “Numerical Solved by Least Recently Used Page Replacement Algorithm”

Leave a Reply

Your email address will not be published. Required fields are marked *