Page Replacement Algorithm
FIFO, LRU, Optimal Page Replacement Algorithm
1. Consider the page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3,
0, 3, 2 with 4 page frames. Find number of page Hit and
page Faults.
2. Consider the page reference string of size 12: 1, 2, 3, 4, 5,
1, 3, 1, 6, 3, 2, 3 with frame size 4. Find number of page Hit
and page Faults.
3. Consider a reference string: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2. the
number of frames in the memory is 3. Find out the number of
page faults
4. Given page reference string: ●
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 with frame size 4. Find
number of page Hit and page Faults.