Question

1 Consider the following page reference string 1,2,3,5,2,3,5,7,2,1,2,3,8,6,4,3,2,2,3,6. Assuming there are three memory frames, how many faults would occur in the case of i) LRU ii) Optimal algorithm iii) FIFO . Note that initially all frames are empty.

Answer 1

Answer:

14-fifo

Explanation:

If the page is not in the physical memory, it has to be loaded.

For this different algorithms are used like FIFO(First In First Out) , LIFO(Last In First Out) etc..

FIFO

3 frames

14 page faults