Given the following reference string

Given the following reference string:

0   2   1   3   0   1   4   0   1   2   3   4 

show

Page faults occur during the processing of the reference scheme?

The hit ratio is for each of the following policies in a pure demand paging system?

What do you observe when you move from Scheme 1 to Scheme 2? Explain.

Scheme 1: FIFO with three pages of main memory

Scheme 2: FIFO with four pages of main memory