Least Recently Used(LRU) Page Replacement Policy - Example - Operating System

Q.  We have a process that has been allocated 3 page frames and initially none of the pages of the process are available in the memory. The following sequence of page references (reference string) is made by the process :
1, 2, 1, 3, 7, 4, 5, 6, 3, 1
How many page faults will occur for the above reference string with the Least Recently Used(LRU) Page Replacement Policy in comparison to an Optimal Page Replacement policy?
- Published on 26 Aug 15

a. 3
b. 2
c. 1
d. 0

ANSWER: 2

Related Content

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲