Assignment – Virtual Memory Page ReplacementAlgorithms
Consider the following virtual page reference sequence: page 1,2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3. This indicates that theseparticular pages need to be accessed by the computer in the ordershown. Consider each of the following 4 algorithm-framecombinations:
LRU with 3 frames
FIFO with 3 frames
LRU with 4 frames
FIFO with 4 frames
Print a copy of this page. For each of the 4 combinations,below, move from left to right as the virtual page numbers arerequested in sequence. Put each virtual page into one of the framesby writing its number there (initially while empty frames remain,load
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured