Question: Given Page requests: Reference string: 1 , 1 , 2 , 1 , 1 , 3 , 1 , 4 , 3 , 2 ,

Given Page requests: Reference string: 1,1,2,1,1,3,1,4,3,2,4,2
1.
LRU
Assume there are 3 page frames of physical memory
3.
NFU / LFU
Assume there are 3 page frames of physical memory
There can be situation/s where more than one page can be evicted. In that case: use LRU to determine which page gets evicted.
3.
AGING
Assume there are 3 page frames of physical memory
Also assume there are 4 bits in the counter for each page

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!