Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3.. Assuming demand pag
Posted: Fri Jul 01, 2022 5:39 am
Consider the following page reference string:7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3..Assuming demand paging with three frames, how many page faultswould occur for the following replacement algorithms?• LRU replacement• Optimal replacement
F07 F1 F2 FO 7 LRU: Answer: F1 F2 23 7 2 Optimal: Answer: 6 72 31 253 4677 105 4 6 2 3 2
- Consider The Following Page Reference String 7 2 3 1 2 5 3 4 6 7 7 1 0 5 4 6 2 3 Assuming Demand Pag 1 (39.52 KiB) Viewed 39 times