...
2011 December UGC NET Paper 1
May 3, 2024
Question 841 – Computer-Networks
May 4, 2024
2011 December UGC NET Paper 1
May 3, 2024
Question 841 – Computer-Networks
May 4, 2024

Database-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
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
Question 22 Explanation: 

The above schedule is not conflict serializable.
Correct Answer: B
Question 22 Explanation: 

The above schedule is not conflict serializable.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!