CompleteGATE Doubts Forum
0 like 0 dislike
140 views
  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 

asked Jul 2, 2016 in Database Management System by CompleteGATE-AskUS (3,550 points) | 140 views

1 Answer

1 like 0 dislike
Best answer
  1. (B) a schedule that is not conflict serializable

answered Jul 2, 2016 by ebeisaac (13,250 points)
selected Jul 11, 2016 by CompleteGATE-AskUS
Welcome to Completegate AskUs, A place where you can ask questions regarding videos located at Youtube Channel and receive answers from our experts.

Sign up for our newsletter to receive the latest news and event postings.

Best Users 11/2019
  1. CompleteGATE-AskUS

    3550 Points

  2. Asma Abbasi

    200 Points

  3. Henry

    150 Points

  4. SilverChat

    140 Points

Rewards per month
First Winner: 0 INR (Not Started)
Second Winner: 0 INR (Not Started)

×

Like us on Facebook

Show your Support. Become a FAN!

108 questions
100 answers
2 comments
86 users