There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called :
A. queue algorithms
B. stack algorithms
C. string algorithms
D. None of the mentioned
Answer:A
There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called :
A. queue algorithms B. stack algorithms C. string algorithms D. None of the mentioned
Explanation: None.