

MCQOPTIONS
Saved Bookmarks
1. |
Consider the following transactions with data items P and Q initialized to zero: T1: read (P) ; read (Q) ; if P = 0 then Q : = Q + 1 ; write (Q) ; T2: read (Q) ; read (P) ; if Q = 0 then P : = P + 1 ; write (P) ; Any non-serial interleaving of T1 and T2 for concurrent execution leads to |
A. | A serializable schedule |
B. | A schedule that is not conflict serializable |
C. | A conflict serializable schedule |
D. | A schedule for which a precedence graph cannot be drawn |
Answer» C. A conflict serializable schedule | |