Question

Consider the following page reference string 7,0,1,2,0,3,0,4,2,3,0,3,,1,,0,1,7,0,1. how many page faults would occur for the following page replacement algorithm assuming three and four frames? remember all frames are initially empty?

Answer 1

In this algorithm, pages are replaced which are not used for the longest duration of time in the future. Let us consider page reference string 7 0 1 2 0 3 0 4 2 3 0 3 2 and 4 page slots.