4,205 views
0 votes
0 votes
Consider the following page reference string:

$7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0 , 1.$

Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms ?

$•$ $LRU$ $replacement$
$•$ $FIFO$ $replacement$
$•$ $Optimal$ $replacement$

1 Answer

0 votes
0 votes

LRU replacement => 18
FIFO replacement => 17
Optimal replacement => 13

 

Related questions

0 votes
0 votes
0 answers
4
akash.dinkar12 asked Mar 21, 2019
373 views
What is the copy-on-write feature, and under what circumstances is its use beneficial ? What hardware support is required to implement this feature ?