Question: PLEASE READ THE QUESTION CAREFULLY, AND THEN ANSWER. A page replacement algorithm should minimize the number of page faults. Consider the following page reference string:
PLEASE READ THE QUESTION CAREFULLY, AND THEN ANSWER.

A page replacement algorithm should minimize the number of page faults. Consider the following page reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2 Assuming demand paging with FOUR page frames, how many page faults would occur for the following replacement algorithms? Show all your works. i. FIFO [3] ii. OPT [4] iii. Compare and discuss both algorithms in term of page faults occurred? Which do you think is better? [2]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
