Q. 64 Two transactions T1 and T2 are given as:
T1: r1(X)w1(X)r1(Y)w1(Y) T2 : r2(Y)w2(Y)r2(Z)w2(Z)
where ri(V) denotes a read operation by transaction Ti on a variable V and wi(V) denotes a write operation by transaction Ti on a variable V. The total number of conflict serializable schedules that can be formed by T1 and T2 is ______
Note: This question appeared as Numerical Answer Type.
(A) 54
(B) 55
(C) 56
(D) 57
Answer: (A)
Explanation:
