Multiple choice

Which of these is a deadlock avoidance strategy?

  1. Bakery Algorithm

  2. Banker's Algorithm

  3. Belady's Anomaly

  4. Demand Paging

  5. Resource-Allocation graph
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The Banker's algorithm is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of pre-determined maximum possible amounts of all resources, and then makes a safe-state check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.

Keep practicing — related questions