Question

Consider the following page preferences string 1,2,3,4,5,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,4,5,3. How many page faults would occur in FIFO replacement algorithms? Assume four frames and all frames are initially empty.

Answer 1

Answer:

100000000000000000 million