A process has been allocated 3 page frames. Assume that none of the pages of…
GATE · 2007 · CS
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?
- A.
7
- B.
8
- C.
9
- D.
10
Attempted by 311 students.
Sign up free to check your answer
Sign up freeLoading lesson…