GATE Computer Science (CS) 2017 Shift 2 Solved Paper
© examsiri.com
Question : 54 of 65
Marks:
+1,
-0
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 _________.
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 _________.
- Your Answer:
Go to Question: