A process refers to 5 pages A, B, C, D, E in the order: A, B, C, D, A, B, E,…
2018
A process refers to 5 pages A, B, C, D, E in the order: A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of pages which transfer with an 'empty internal store of 3 frames' is:
- A.
8
- B.
10
- C.
9
- D.
7
Attempted by 47 students.
Show answer & explanation
Correct answer: C
FIFO replaces the oldest page in memory. With 3 frames, pages A, B, and C fill slots initially causing faults. References D, A, B, E replace older pages causing further faults. Pages A and B subsequently hit existing frames without transfer. References C and D cause faults, while the final E hits a frame. This sequence results in exactly 9 page transfers.