Question: Given a page reference string a s: {1, 3, 2, 4, 1, 3, 5, 1, 3, 2, 4, 5}. Does this page reference string suffer
Given a page reference string a s: {1, 3, 2, 4, 1, 3, 5, 1, 3, 2, 4, 5}. Does this page reference string suffer from Beladys anomaly when the page replacement algorithm is a) FIFO, b) Optimal, and c) LRU? Note: you will need to check the window size from 3 up to 5.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
