Question: 2. (12 points) Consider the following page reference string: 9, 1,4, 1, 2, 5, 9, 5, 7, 9, 2, 2, 0,9, 8, 6, 2, 3,0,
2. (12 points) Consider the following page reference string: 9, 1,4, 1, 2, 5, 9, 5, 7, 9, 2, 2, 0,9, 8, 6, 2, 3,0, 1, 4, 3, 6, 1, 2 Assuming demand paging with 3 frames, how many page faults would occur for the following replacement algorithms? List the processing steps of each algorithm. LRU replacement FIFO replacement Optimal replacement
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
