Ask your own question, for FREE!
Computer Science 11 Online
OpenStudy (anonymous):

CAN A RESOURCE ALLOCATION GRAPH HAVE CYCLES WITHOUT A DEADLOCK EXISTING.IF SO,STATE WHY AND DRAW A SIMPLE GRAPH TO JUSTIFY.IF NO,STATE WHY?

OpenStudy (anonymous):

If the graph has no cycles, deadlock cannot exist. If the graph has a cycle, deadlock may exist. If number of resources are more than required, no deadlock will occur.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!