For reference string 1,2,3,4,1,2,5,1,2,3,4,5 with 3 frames using FIFO, how many page faults occur?
For reference string 1,2,3,4,1,2,5,1,2,3,4,5 with 3 frames using FIFO, how many page faults occur?
Answer
9
Theory
FIFO replaces the page that has been in memory the longest.
Solution
Tracing the string with 3 frames in FIFO order yields 9 page faults.