## Discussion Forum

Que. | Suppose for a process P, reference to pages in order are 1,2,4,5,2,1,2,4. Assume that main memory can accommodate 3 pages and the main memory has already 1 and 2 in the order 1 – first, 2 – second. At this moment, assume FIFO Page Replacement Algorithm is used then the number of page faults that occur to complete the execution of process P is |

a. | 4 |

b. | 3 |

c. | 5 |

d. | 6 |

Answer:5 |