Q. 39 Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x , denoted by r x ^ h and w x ^ h respectively. Which one of them is conflict serializable?
(A) r1^xh;r2^xh;w1^xh;x3^xh;w2^xh
(B) r2^xh;r1^xh;w2^xh;r3^xh;w1^xh
(C) r3^xh;r2^xh;r1^xh;w2^xh;w1^xh
(D) r2^xh;w2^xh;r3^xh;r1^xh;w1^xh
Answer: (D)
Explanation:
