Two transactions T1 and T2 are given as follows:

T1: R1(A) W1(A) R1(B) W1(B)
T2: R2(B) W2(B) R2(C) W2(C)

The total number of conflicts serializable schedules that can be formed by T1 and T2 are:

Solution : Answer is 54. 

Leave a Reply

Your email address will not be published. Required fields are marked *