1.

A deadlock exists in the system if and only if the wait for graph:

A. has a cycle in it
B. has a path from first node to last node
C. is a tree
D. none of the above
Answer» B. has a path from first node to last node


Discussion

No Comment Found