Consider the following page reference string: 7, 7, 2, 2, 7, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1 Assuming demand paging with three frames, how many page faults would occur for the LRU page replacement algorithm

Consider the following virtual page reference string: 1, 2, 3, 4, 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 the physical memory has a total size of one, two, three, or four physical pages? Assume that all physical pages are initially empty (i.e., the system is newly started), so your fırst unique pages will all cost one fault each. • Strict LRU replacement (assuming all the timestamps in the history can be captured and stored precisely) • FIFO replacement Number of physical frames LRU FIFO 20 20 2 3 10 14 4.

Consider the following page reference string: 3,1,3,6,7,5,1,4,5,6,2,2,6,2,2,7,4,5,1,7,2 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms?  Show procedure  Optimal replacement

1. Consider pge reference string 1,3,0,3,5,6 with 3 page frames. Find number of page faults in following algorithm 1) Least Recently Used 2) Optimal Replacement