Multiple choice

What problem is solved by Dijkstra's Banker's algorithm?

  1. Mutual Exclusion

  2. Deadlock Recovery

  3. Deadlock Avoidance

  4. Cache Coherence

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

Dijkstra's Banker's algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources.