InterviewSolution
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 mentionedThis question was addressed to me during an interview for a job.Asked question is from Virtual Memory in chapter The Linux System of Operating System |
|
Answer» Correct ANSWER is (b) STACK algorithms |
|