Explanation:The timeout scheme is particularly easy to implement, and works well if transactions are short and if longwaits are likely to be due to deadlocks. 7. The deadlock in a set of transaction can be determined by
A. Read-only graph
B. Wait graph
C. Wait-for graph
D. All of the mentioned
Answer:A
Explanation:The timeout scheme is particularly easy to implement, and works well if transactions are short and if longwaits are likely to be due to deadlocks. 7. The deadlock in a set of transaction can be determined by
A. Read-only graph B. Wait graph C. Wait-for graph D. All of the mentioned
Explanation:Each transaction involved in the cycle is said to be deadlocked. 8. A deadlock exists in the system if and only if the wait-for graph contains a ___________.