Computer Sciences > GATE 2014 SET-3 > Transaction Schedules
Consider the transactions T₁, T₂, and T₃ and the schedules S₁ and S₂ given below.
T₁: r₁(X); r₁(Z); w₁(X); w₁(Z)
T₂: r₂(Y); r₂(Z); w₂(Z)
T₃: r₃(Y); r₃(X); w₃(Y)
S₁: r₁(X); r₃(Y); r₃(X); r₂(Y); r₂(Z); w₃(Y); w₂(Z); r₁(Z); w₁(X); w₁(Z)
S₂: r₁(X); r₃(Y); r₂(Y); r₃(X); r₁(Z); r₂(Z); w₃(Y); w₁(X); w₂(Z); w₁(Z)
Which one of the following statements about the schedules is TRUE?
T₁: r₁(X); r₁(Z); w₁(X); w₁(Z)
T₂: r₂(Y); r₂(Z); w₂(Z)
T₃: r₃(Y); r₃(X); w₃(Y)
S₁: r₁(X); r₃(Y); r₃(X); r₂(Y); r₂(Z); w₃(Y); w₂(Z); r₁(Z); w₁(X); w₁(Z)
S₂: r₁(X); r₃(Y); r₂(Y); r₃(X); r₁(Z); r₂(Z); w₃(Y); w₁(X); w₂(Z); w₁(Z)
Which one of the following statements about the schedules is TRUE?
Explanation
Correct : a
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.