Q. A system is in a state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set. (Solved)
1. idle
2. waiting
3. deadlock
4. ready
- c. deadlock
1. idle
2. waiting
3. deadlock
4. ready