The following schedule of three transactions $T_1,T_2,T_3$ operates on data items $A,B,C$. The operations are listed in the order they occur:

1. $r_1(A)$
2. $r_2(B)$
3. $w_1(A)$
4. $r_1(B)$
5. $w_2(B)$
6. $w_2(C)$
7. $r_3(C)$
8. $w_3(A)$

(a) Construct the precedence graph for this schedule.
(b) Is the schedule conflict‑serializable? If yes, give one equivalent serial order of the transactions.

Question

The following schedule of three transactions $T_1,T_2,T_3$ operates on data items $A,B,C$. The operations are listed in the order they occur:

1. $r_1(A)$
2. $r_2(B)$
3. $w_1(A)$
4. $r_1(B)$
5. $w_2(B)$
6. $w_2(C)$
7. $r_3(C)$
8. $w_3(A)$

(a) Construct the precedence graph for this schedule.
(b) Is the schedule conflict‑serializable? If yes, give one equivalent serial order of the transactions.

Accepted Answer

Yes, conflict‑serializable; equivalent serial order T1 → T2 → T3

Neco 2023 Computer Studies Question 49

Answer Options

About This Question

Master the Exam!