Consider the following transactions with data items P and Q initialized to zero: T 1 :read (P); read (Q); if P = 0 then Q := Q + 1 ; write (Q). T 2 : read (Q); read (P); if Q = 0 then P := P + 1 ; write (P). Any non-serial interleaving of T 1 and T 2 for concurrent execution leads to

Correct Answer is : a schedule that is not conflict serializable

a schedule that is not conflict serializable

a conflict serializable schedule

a schedule for which a precedence graph cannot be drawn

GATE Computer Science (CS) 2012 Solved Paper

Question : 37 of 65

Marks: +1, -0

Consider the following transactions with data items P and Q initialized to zero:
T₁ :read (P);
read (Q);
if P = 0 then Q := Q + 1 ;
write (Q).
T₂ : read (Q);
read (P);
if Q = 0 then P := P + 1 ;
write (P).
Any non-serial interleaving of T₁ and T₂ for concurrent execution leads to

a serializable schedule
a schedule that is not conflict serializable
a conflict serializable schedule
a schedule for which a precedence graph cannot be drawn

Validate

Go to Question:

Prev Question

Next Question