0
819views
Virtual Memory question

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 the following page replacement algorithms, assuming four frames? Remember all frames are initially empty, so your first unique pages will cost one fault each. a. FIFO page replacement b. Optimal page replacement c.LRU page replacement

Please log in to add an answer.