1.

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) and w(x) respectively. Which one of them is conflict serializable.(A) A(B) B(C) C(D) D

Answer»


Discussion

No Comment Found

Related InterviewSolutions