Computer Terminology

How does bankers algorithm avoid deadlock It seems a very obvious algorithm where simply the resources whose needs are less than available are given the resources?

123

Answer

User Avatar
Wiki User
01/06/2009

step 1: if(need < available) True then, process allocated.. We find new available : old available + allocation step 2: else false go to step 1