Discussion Forum

Que. Two transactions T₁ and T₂ are given as follows:

T₁: r₁ (A); w₁(A); r₁ (B); w₁(B)

Find the no. of conflict serializable schedules that can be formed over T₁ and T₂.
a. 12
b. 13
c. 14
d. 15
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: