Computer Sciences > GATE 2024 SET-1 > Transaction Schedules
Consider the following read-write schedule S over three transactions T1 T2, and T3 where the subscripts in the schedule indicate transaction IDs:
Which of the following transaction schedules is/are conflict equivalent to S?
A
T1 T2 T3
B
T1 T3 T2
C
T3T2 T1
D
T3T1 T2

Correct : a,b,c,d

Similar Questions

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₁:...
#1303 MCQ
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₁:...
#1303 MCQ
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₁:...
#1303 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......