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.
Answer: C
Correct answer: Deadlock
A deadlock is a circle of waiting: each transaction in the set holds a lock another needs and waits for one that another holds, so none can proceed. Nothing resolves itself - the system must detect the cycle and roll one of them back.
Please log in or register to report this question.