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
-
Least Recently Used (LRU) page replacement policy is a practical approximation to optimal page replacement. For the above reference string, how many more page faults occur
with LRU than with the optimal page replacement policy?
-
- zero
- 1
- 2
- 3
- zero
Correct Option: C
LRU replaces the page which is used least recently.
Page frames
Total number of page faults = 9
Therefore, an increase of 2 is there (9 – 7) in LRU than in optimal.
