Q. A deadlock exists in the system if and only if the wait for graph: (Solved)
1. has a cycle in it
2. has a path from first node to last node
3. is a tree
4. none of the above
- a. has a cycle in it
1. has a cycle in it
2. has a path from first node to last node
3. is a tree
4. none of the above