📝 FIFO page replacement

Q1. A system has three physical frames. The page reference string is 1, 2, 3, 4, 1, 2, 5. Using FIFO replacement, which page is evicted when the reference to page 5 occurs?

💡 Difficulty: easy | ✅ Correct: D

Q2. A system with four frames receives the reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2. Using FIFO, how many page faults occur?

💡 Difficulty: medium | ✅ Correct: B

Q3. A program generates 100 page references. With FIFO replacement using 5 frames, it incurs 20 page faults. What is the page fault rate? Additionally, after these references, the FIFO queue holds pages {A,B,C,D,E} in that order, where A is the oldest. If the next reference is to page F, which page will be evicted?

💡 Difficulty: hard | ✅ Correct: A