Operating Systems · Question 19 · Easy
Belady's anomaly, where giving a process more page frames can increase its page faults, can occur with which algorithm?
- FIFO
- LRU
- Optimal
- None; more frames always reduce page faults
Answer and explanation
Answer: A. FIFO
Explanation: FIFO is not a stack algorithm, so its set of resident pages with n frames is not always a subset of the set with n + 1 frames. LRU and Optimal are stack algorithms and never show the anomaly.
Previous: Which page-replacement algorithm gives the lowest possible number of page… · Next: In UNIX and Linux, which system call creates a new process that is a copy of…
Practise operating systems
Try a fresh set of operating systems questions with an explanation after every answer, free and without signing up: Operating Systems practice. Or sit a full placement mock test.
More operating systems questions
- The Banker's algorithm is used for which deadlock-handling strategy?
- Which of the following is NOT shared between threads of the same process?
- Which page-replacement algorithm gives the lowest possible number of page…
- In UNIX and Linux, which system call creates a new process that is a copy of…
- A system has 3 page frames, all initially empty. For the page reference string…
- Process (arrival time, burst time) in ms: P1 (0, 7), P2 (2, 4), P3 (4, 1), P4…
- How many times is "A" printed when this C program runs? Assume every fork()…
- A disk has cylinders 0 to 199 and the head is at cylinder 50. The request…
- A system uses 32-bit logical addresses, a page size of 4 KB and 4-byte…
- Process (arrival time, burst time, priority) in ms: P1 (0, 5, 3), P2 (1, 3…
More technical & programming practice
Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics · Pseudo-code · C Programming · Java · Python
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge