Question: Given the reference string 1,2,3,4,5,2,3,4,5,2,1,5,4,1, how many page faults occur? Initially, page table entries are invalid. Use FIFO and 3 physical frames. 9 10 11
Given the reference string 1,2,3,4,5,2,3,4,5,2,1,5,4,1, how many page faults occur? Initially, page table entries are invalid. Use FIFO and 3 physical frames. 9 10 11 12 QUESTION 9 Given the same reference string as in the previous question: 1,2,3,4,5,2,3,4,5,2,1,5,4,1, assuming pure demand paging, how many page faults does the Optimal algorithm causes, given 3 physical frames? 6 7 8 9
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
