ExamCompetition Your Success, Our Mission
Login Register
Question discussion

A deadlock among transactions in a DBMS can be detected by checking whether the wait-for graph contains

2323Medium DSSSB TGT Computer Science 0 replies 1 views
0

A deadlock among transactions in a DBMS can be detected by checking whether the wait-for graph contains

  • Aa node with no outgoing edge
  • Ba cycle
  • Cmore than one connected component
  • Da node with no incoming edge
Correct answer: B

Explanation

An edge Ti → Tj means Ti waits for a lock held by Tj; a cycle in this graph means that the transactions in the cycle are deadlocked.
Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!