aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Operating Systems Fundamentals
  • Which of the following suffers from Belady's anomaly?
Multiple choice

Which of the following suffers from Belady's anomaly?

  1. Optimal page replacement policy

  2. Least recently used policy

  3. First in first out policy

  4. Shortest job first

  5. Round robin

Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

On increasing the number of frames, page fault sometimes increases.

Keep practicing — related questions

  • In which one of the following page replacement policies, Belady's anomaly may occur?a
  • Which of the following page replacement algorithms suffer(s) from Belady's Anomaly?
  • Which of the following is/are the cause(s) of Belady's anomaly in operating system?
  • Which of the following page replacement algorithms produces the lowest page fault rate of all the algorithm...
  • Which of the following options gives the correct combinations of the following statements about LRU (Least ...
  • Which page replacement algorithm swaps out the page whose next use will occur farthest in the future?
  • In general case, page fault decreases with increase in the number of frames. But in some page replacement a...
  • If a process is spending much more time in paging than executing, then this phenomenon is called __________.
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy