and 3 others joined a min ago.
0
6.7kviews
Consider the following page referencing string 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.
written 6.9 years ago by
snehalb
• 910
|
modified 4.7 years ago
by
prashantsaini
• 0
|
How many page faults would occur for the following replacement algorithms assuming one, two,three,four, five, six and seven frames. Remember that all frames are initially empty so your frist unique pages will cost one fault each
- LRU replacement
- FIFO replacement
- Optional replacement
ADD COMMENT
EDIT
1 Answer