Question: Given the page reference sequence 1 3 5 4 2 4 3 2 1 0 5 3 5 0 4 3 5 4 3 2
Given the page reference sequence 1 3 5 4 2 4 3 2 1 0 5 3 5 0 4 3 5 4 3 2 1 3 4 5
(a) Perform the access sequence with the replacement strategies as follows for the case of a cache capacity of four pages:
(i) Least Recently Used (LRU) Page Replacement Algorithm
(ii) Optimal Page Replacement Algorithm
(b) Calculate the hit rate and the miss rate for the LRU and Optimal scenarios.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
