Deadlocks on Operating System related Questions and Answers

Question :   The wait-for graph is a deadlock detection algorithm that is applicable when : 1. all resources have a single instance 2. all resources have multiple instances 3. all resources have a single 7 multiple instance 4. all of the mentioned Answer :   1 - all resources have a single instance