Examveda
Examveda

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

Answer: Option C

Solution(By Examveda Team)

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.

This Question Belongs to Computer Fundamentals >> Operating System

Join The Discussion

Related Questions on Operating System

Identify false statement

A. You can find deleted files in recycle bin

B. You can restore any files in recycle bin if you ever need

C. You can increase free space of disk by sending files in recycle bin

D. You can right click and choose Empty Recycle Bin to clean it at once