8 votes 8 votes What problem is solved by Dijikstra banker' algorithm? Mutual exclusion Deadlock recovery Deadlock avoidance Cache coherence Operating System isro2017 operating-system bankers-algorithm + – sh!va asked May 7, 2017 edited Dec 9, 2022 by Lakshman Bhaiya sh!va 5.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 12 votes 12 votes (C) Deadlock Avoidance is solved by Banker's Algorithm. Banker's algorithm pretends to have allocated te required resources to the processes, and if the system doesn't lead to deadlock, it actually allocates the resources. Samujjal Das answered May 7, 2017 selected May 8, 2017 by ManojK Samujjal Das comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes C: Deadlock Avoidance. Using Banker's algorithm we can get to know about the safe or unsafe state. AnilGoudar answered May 11, 2017 AnilGoudar comment Share Follow See all 0 reply Please log in or register to add a comment.