Start learning →

The DBMS detects a deadlock by finding

Atwo transactions with the same start timestamp
Ba chain of more than 3 waiting transactions
Ca transaction that has aborted more than once
Da directed cycle in the wait-for graph
Answer & Solution
Correct answer: D. a directed cycle in the wait-for graph
A cycle in the wait-for graph means each transaction in the cycle is waiting for a lock held by the next one, and no one can move. Detection = periodically run a cycle-finding algorithm on the graph. Same timestamp, chain length and abort history are unrelated to deadlock detection.
Practise this question with Quill — GATE CSE →

Keep practising Database Management Systems

Browse all Database Management Systems questions for GATE CSE, or explore more Computer Science topics.

Start a Database Management Systems lesson →
Related questions
Database concepts bingoWhich ones belongSpot the false statementRows or columnsWhich one does not belongCandidate or primary keyOrder the case for a DBMSOne word is wrong