Direction: A process has been allocated 3 page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequence of page references (reference string)
1, 2, 1, 3, 7, 4, 5, 6, 3, 1
-
If optimal page replacement policy is used, how many page faults occur for the above reference string?
-
- 7
- 8
- 9
- 10
- 7
Correct Option: A
Optimal page replacement policy replaces the page which will not be used for longest time
Page frames
Total number of page fault = 7
