Question

Consider page reference string 1, 3, 0, 3, 5, 6 with 3 page frames.Find number of page fault using FIFO Algorithm.

Answer 1

The number of page fault using FIFO Algorithm:

Explanation:

• Initially all slots are empty, so when 1, 3, 0 came they are allocated to the empty slots = 3 Page Faults.
• when 3 comes, it is already in memory so we have 0 Page Faults.
• Then 5 comes, it is not available in memory so it replaces the oldest page slot 1. = 1 Page Fault.
• Finally 6 comes, it is also not available in memory so it replaces the oldest page slot 3  = 1 Page Fault.
• So total page faults = 5.