Question

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string?

Answer 1

223 8s an order of algorithm faults refrénce fifio 14 suppose in 14 and 123 no need to take other numbers