Consider a schedule with three transactions. T1, T2 and T3 executed concurrently.

Question

The schedule is given below. Find out the category of the schedule

S: R1(X),R2(Z)R1(Z),R3(X) W1(X) W3(Y) R2(Y) W2(Z) W2(Y) C1 C2 C3

• Recoverable schedule

• Conflict Serializable

• Strict schedule

• None of these

Comments

it seems without reading database subject, you're trying to solve the questions.

Answer 1

It's not strict schedule because W3(Y) is followed by R2(Y). it's a dirty read. 

It's not recover schedule because W3(Y) is followed by R2(Y). and T2 committed before T3. 

It's Conflict serializable, because no cycle in the precedence graph.

(B) is correct option!