Consider the following schedules involving two transactions. Which one of the…

2007

Consider the following schedules involving two transactions. Which one of the following statements is TRUE?

1. A.

   Both S1 and S2 are conflict serializable.

2. B.

   S1 is conflict serializable and S2 is not conflict serializable.

3. C.

   S1 is not conflict serializable and S2 is conflict serializable.

4. D.

   Both S1 and S2 are not conflict serializable.

Attempted by 50 students.

A video solution is available for this question — log in and enroll to watch it.