Explain Deadlock Prevention-Resource allocation graph allocation
Resource allocation graph algorithm: Using this algorithm we are able to actually know if there exists in the system. For the reason that if there exists a cycle in the graph then there is a deadlock. In this graph we have acquired both the process and the resources. There is as well request edge and assignment edge.