

MCQOPTIONS
Saved Bookmarks
1. |
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» C. string algorithms | |