GATEverse Practice, past papers & mock tests
GATE 2016 · CS2 - Afternoon
Database ManagementTransactions and Concurrency ControleasyMCQ1 mark
Construct the precedence graph of schedule S with vertices representing transactions and edges representing conflicts. If S is serializable, which ordering of the vertices is guaranteed to yield a serial schedule?
Save your progress

Related Database Management PYQs