Galvin Edition 9 Exercise 9 Question 8 (Page No. 451)
Consider the following page reference string: $1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.$ How many page faults would occur for the following replacement algorithms, assuming one, ... frames are initially empty, so your first unique pages will cost one fault each. $LRU$ replacement $FIFO$ replacement $Optimal$ replacement
Consider the following page reference string:$1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.$How many page faults would occur for the following replacement a...