Logo

Consider the following page reference string: 3, 3, 5, 4, 7, 1, 5, 5, 1, 4, 3, 7, 6, 3, 4, 1. How many page faults would occur for each of the…

bitm Operating System · 2019 · Solved Question with Answer

Consider the following page reference string: 3, 3, 5, 4, 7, 1, 5, 5, 1, 4, 3, 7, 6, 3, 4, 1. How many page faults would occur for each of the following page replacement algorithms assuming 4 page frames?

i. LRU

ii. FIFO

Solution

Please login to view the answer.