申論題

7. (5 points) Consider the following page reference sequence in a demand paging system. Assume that initially all the frames of the process are empty.
 1,2,3,4,2,1,5,6,8,1,2,3,7,6,3,2,4, 2, 3, 6.
Please answer which of the following statements is/are correct!

(c) If the process is allocated 5 frames, the FIFO algorithm incurs 13 page faults.