Question: Consider the following page reference string: 2 , 2 , 3 , 3 , 4 , 4 , 5 , 5 , 2 , 2

Consider the following page reference string:
2,2,3,3,4,4,5,5,2,2,3,3
Assuming demand paging with 2 frames, what is the minimum possible number of page faults?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!