What problem is solved by Dijkstra's banker's algorithm?
A
mutual exclusion
B
deadlock recovery
C
deadlock avoidance
D
cache coherence
E
None of the above
Correct Answer: deadlock avoidance
Deadlock Avoidance is solved by Banker's Algorithm. Banker's algorithm pretends to have allocated to required resources to the processes, and if the system doesn't lead to deadlock, it actually allocates the resources.