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?
A
Only S₁ is conflict-serializable.
B
Only S₂ is conflict-serializable.
C
Both S₁ and S₂ are conflict-serializable.
D
Neither S₁ nor S₂ is conflict-serializable.

Correct : a

Similar Questions

Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) res...
#1332 MCQ
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) res...
#1332 MCQ
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) res...
#1332 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......