What problem is solved by Dijkstra's banker's algorithm?
Options
A. mutual exclusion
B. deadlock recovery
C. deadlock avoidance
D. cache coherence
E. None of the above
Correct Answer
deadlock avoidance
Explanation
The Banker's algorithm is a resource allocation & 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.
More questions
1. In which of the storage placement strategies a program is placed in the smallest available hole in the main memory?