Operating Systems · Question 16 · Easy
The Banker's algorithm is used for which deadlock-handling strategy?
- Deadlock prevention
- Deadlock avoidance
- Deadlock detection and recovery
- Ignoring deadlocks (ostrich approach)
Answer and explanation
Answer: B. Deadlock avoidance
Explanation: The Banker's algorithm grants a request only if the resulting state is still safe, so it avoids deadlock dynamically. Prevention instead removes one of the four necessary conditions outright.
Previous: Two processes enforce mutual exclusion using only a shared variable turn… · Next: Which of the following is NOT shared between threads of the same process?
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
- A system has 3 page frames, all initially empty. For the page reference string…
- A TLB lookup takes 20 ns and a main-memory access takes 100 ns. On a TLB miss…
- Two processes enforce mutual exclusion using only a shared variable turn…
- Which of the following is NOT shared between threads of the same process?
- Which page-replacement algorithm gives the lowest possible number of page…
- Belady's anomaly, where giving a process more page frames can increase its…
- 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()…
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