Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
Which of the following options, gives the correct number of page faults related of LRU, FIFO, and optimal page replacement algorithms respectively, assuming 05 page frames and all frames are initially empty?
Show answerHide answer
Correct answer: (B) 8, 10, 7
Explanation
With 5 frames: (1) LRU algorithm: total number of page faults = 8. (2) FIFO algorithm: total number of page faults = 10. (3) Optimal algorithm: total number of page faults = 7.