Question: Consider the following page reference string 1, 3, 2, 7, 2, 3, 5, 2, 1, 1, 7, 6, 0, 5, 4, 6, 2, 3, 0,
Consider the following page reference string 1, 3, 2, 7, 2, 3, 5, 2, 1, 1, 7, 6, 0, 5, 4, 6, 2, 3, 0, 1. Assuming demand paging with four frames, how many page faults would occur for LRU replacement and FIFO replacement algorithms?
note: need a table
subject: operating system
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
