Multiple choice What problem is solved by Dijkstra's Banker's algorithm? Mutual Exclusion Deadlock Recovery Deadlock Avoidance 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.