2011 December UGC NET Paper 1
May 3, 2024Question 841 – Computer-Networks
May 4, 2024Database-Management-System
| Question 22 |
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 serializable schedule | |
| a schedule that is not conflict serializable | |
| a conflict serializable schedule | |
| a schedule for which a precedence graph cannot be drawn |
Question 22 Explanation:
The above schedule is not conflict serializable.
Correct Answer: B
Question 22 Explanation:
The above schedule is not conflict serializable.