1
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.
T1 : r1 (X) ; r1 (Z) ; w1 (X) ; w1 (Z)
T2 : r2 (X) ; r2 (Z) ; w2 (Z)
T3 : r3 (X) ; r3 (X) ; w3 (Y)
S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(X); w1(Z)
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z)
Which one of the following statements about the schedules is TRUE?2
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider the following four schedules due to three transactions (indicated by the subscript) using
read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is
conflict serializable?
3
GATE CSE 2012
MCQ (Single Correct Answer)
+2
-0.6
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 to4
GATE CSE 2010
MCQ (Single Correct Answer)
+2
-0.6
Consider the following schedule for transactions T1, T2 and T3:
Which one of the schedules below is the correct serialization of the above?
Questions Asked from Transactions and Concurrency (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 1 (1)
GATE CSE 2022 (1)
GATE CSE 2021 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2012 (1)
GATE CSE 2010 (1)
GATE CSE 2009 (2)
GATE CSE 2008 (1)
GATE CSE 2007 (2)
GATE CSE 2004 (1)
GATE CSE 2003 (1)
GATE CSE 1999 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages