Define banker's algorithm deadlock in operating system?
Banker's algorithm is the most famous scheduling algorithm. It is used to avoid
deadlocks in a system having multiple instances for each resource type. This
algorithm was first proposed by Dijkstra in 1965. This algorithm is named as
Banker's algorithm because it could be used in a banking system to ensure that
the bank never allocated its available cash in such a, way that it could no
longer satisfy the cash needs of all its customers or clients.