CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

A process has been allocated 3 page frames. Assume that none of the pages of the process are avaialable in the memory initially. The process makes the following sequence of page reference(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 replacenent. For the above reference string, how many more page fautls occur with LRU than with the optimal page replacement policy?

A
0
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
2
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
1
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
3
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is B 2
Consider the LRU page replacement policy

So total number of page fault = 9
Number of page fault in LRU - Number of page
fault in optional = 9 - 7 = 2 more page fault.

flag
Suggest Corrections
thumbs-up
3
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Hardware Support for Page Table using TLB
OTHER
Watch in App
Join BYJU'S Learning Program
CrossIcon