The deadlock in a set of a transaction can be determined by
(a) Read-only graph
(b) Wait graph
(c) Wait-for graph
(d) All of the mentioned
This question was addressed to me by my college director while I was bunking the class.
I would like to ask this question from Deadlocks topic in chapter Concurrency Control of Database Management