Computer Science · Operating Systems
Which of the following classes of page replacement algorithms can never exhibit Belady's Anomaly?
- 1FIFO-based algorithms
- 2String algorithms
- 3Stack algorithms✓
- 4Queue algorithms
Correct answer
Stack algorithms
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems