Consider the following page reference string: 1, 2, 3, 4, 2, 3, 5,1, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page f
Posted: Mon Jun 06, 2022 4:50 pm
Consider the following page reference string: 1, 2, 3, 4, 2, 3, 5,1, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement algorithms, assuming three frames? a) LRU replacement b) Optimal replacement c) Most Frequently used (MFU) replacement