(a) Consider the following page reference string: 5, 6, 7, 1, 2, 3, 5…

Question

(a) Consider the following page reference string:

5, 6, 7, 1, 2, 3, 5, 6, 7, 1, 2,3,5, 6, 7, 1, 8, 9, 9, 9, 1, 2, 3, 4

How many page faults would occur for the following page replacement algorithms, assuming four frames? All frames are initially empty.

(i) LRU replacement

(ii) FIFO replacement

(iii) Optimal replacement.

(b) Give some reasons as to why local page replacement is better than the global page replacement? (15, 5)

Related pages

• Page Replacement — topic
• Operating Systems syllabus

More PYQs on Page Replacement

• What is a page replacement ? Explain any two page replacement algorithms.
• Consider the following 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 following page replacement algorithm…