Question:

Which one of the following is related to deadlock?

Show Hint

The Banker's algorithm is designed to ensure a system never enters an unsafe state, thus avoiding deadlock.
Updated On: May 4, 2025
  • Dijkstra's algorithm
  • Banker's algorithm
  • Prim's algorithm
  • Kruskal's algorithm
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

- Dijkstra's algorithm: Used for finding the shortest path between nodes in a graph. It is not related to deadlock.
- Banker's algorithm: This algorithm is specifically used to avoid deadlock in systems by ensuring that resource allocation doesn't put the system in an unsafe state. - Prim's algorithm: Used for finding the minimum spanning tree in a graph and is unrelated to deadlock.
- Kruskal's algorithm: Also used for finding the minimum spanning tree in a graph and is not related to deadlock.
Therefore, the correct answer is 2. Banker's algorithm.
Was this answer helpful?
0
0