GATE CSE 2008 | Transactions and Concurrency Question 21 | Database Management System

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

Consider the following three schedules of transactions T₁, T₂ and T₃.
[ Notation: In the following NYO represents the action Y (R for read, W for write) performed by transaction N on object O. ]

(S1) 2RA 2WA 3RC 2WB 3WA 3WC 1RA 1RB 1WA 1WB

(S2) 3RC 2RA 2WA 2WB 3WA 1RA 1RB 1WA 1WB 3WC

(S3) 2RZ 3RC 3WA 2WA 2WB 3WC 1RA 1RB 1WA 1WB

Which of the following statements is TRUE?

S1, S2 and S3 are all conflict equivalent to each other

No two of S1, S2 and S3 are conflict equivalent to each other

S2 is conflict equivalent to S3, but not to S1

S1 is conflict equivalent to S2, but not to S3

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Consider the following schedules involving two transactions. Which one of the following statements is TRUE?

S₁: r₁(X); r₁(Y); r₂(Y); r₂(X); w₂(Y); w₁(X);

S₂: r₁(X); r₂(X); r₂(Y); w₂(Y); r₁(Y); w₁(X);

Both S₁ and S₂ are conflict serializable.

S₁ is conflict serializable and S₂ is not conflict serializable.

S₁ is not conflict serializable and S₂ is conflict serializable.

Both S₁ and S₂ are not conflict serializable.

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Consider the following two transactions: T₁ and T₂.

T₁: read (A);                  T₂: read (B);
    read (B);                      read (A);
    if A = 0 then B ← B + 1;       if B ≠ 0 then A ← A - 1;
    write (B);                     write (A);

Which of the following schemes, using shared and exclusive locks, satisfy the requirements for strict two phase locking for the above transactions?

S1 : lockS(A); 	        S2 : lockS(B);
     read (A);               read (B);
     lockS(B);               lockS(A);
     read (B);               read (A);
     if A = 0                if B ≠ 0
     then B ← B + 1;        then A ← A - 1;
     write (B);              write (A);
     commit;                 commit;
     unlock (A);             unlock (B);
     unlock (B);             unlock (A);

S1 : lockX(A);          S2 : lockX(B);
     read (A);               read (B);
     lockX(B);               lockX(A);
     read (B);               read (A);
     if A = 0                if B ≠ 0
     then B ← B + 1;        then A ← A - 1;
     write (B);              write (A);
     unlock (A);             unlock (A);
     commit;                 commit;
     unlock (B);             unlock (A);

S1 : lockS(A);           S2 : lockS(B);
     read (A);                read (B);
     lockX(B);                lockX(A);
     read (B);                read (A);
     if A = 0                 if B ≠ 0
     then B ← B + 1;         then A ← A - 1;
     write (B);               write (A);
     unlock (A);              unlock (B);
     commit;                  commit;
     unlock (B);              unlock (A);

S1 : lockS(A);           S2 : lockS(B);
     read (A);                read (B);
     lockX(B);                lockX(A);
     read (B);                read (A);
     if A = 0                 if B ≠ 0
    then B ← B + 1;        then A ← A - 1;
     write (B);               write (A);                                                                                                     
     unlock (A);              unlock (A);
     unlock (B);              unlock (B);
     commit;                  commit;

GATE CSE 2004

MCQ (Single Correct Answer)

-0.6

Consider the following schedule S of transactions T1 and T2: GATE CSE 2004 Database Management System - Transactions and Concurrency Question 23 English