Question: Suppose the memory has only 3 frames. With a reference string: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,2, how many page faults will have if FIFO page replacement algorithm is used?
Suppose the memory has only 3 frames. With a reference string: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,2, how many page faults will have if FIFO page replacement algorithm is used?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
