1
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider the following two phase locking protocol. Suppose a transaction $$T$$ accesses (for read or write operations), a certain set of objects $$\left\{ {{O_1},...,{O_k}} \right\}.$$ This is done in the following manner:
Step 1. T acquires exclusive locks to $${{O_1},...,{O_k}}$$ in increasing order of their
addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.
This protocol will
2
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Consider a simple checkpointing protocol and the following set of operations in the log.
(start, $$T4$$); (write, $$T4, y, 2, 3$$); (start, $$T1$$); (commit, $$T4$$); (write, $$T1, z, 5, 7$$);
(checkpoint);
(start, $$T2$$); (write, $$T2, x, 1, 9$$); (commit, $$T2$$); (start, $$T3$$), (write, $$T3, z, 7, 2$$);
If a crash happens now and the system tries to recovver using both undo and redo operations, what are the contents of the undo list and the redo list?
3
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Consider the following partial Schedule S involving two transactions $$T1$$ and $$T2.$$ Only the read and the write operations have been shown. The read operation on data item $$P$$ is denoted by read$$(P)$$ and the write operation on data item $$P$$ is denoted by write $$(P).$$
Suppose that the transaction $$T1$$ fails immediately after time instance $$9.$$ Which one of the following statements is correct?
4
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?
Questions Asked from Transactions and Concurrency (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2021 Set 1 (2)
GATE CSE 2020 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 2 (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
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude