1
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?

A
Undo: $$T3,T1;$$ Redo: $$T2$$
B
Undo: $$T3,T1;\,{\mathop{\rm Re}\nolimits} do:T2,T4$$
C
Undo: none; Redo: $$T2,T4,T3,T1$$
D
Undo: $$T3,T1,T4;\,\,$$ Redo : $$T2$$
2
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).$$ GATE CSE 2015 Set 3 Database Management System - Transactions and Concurrency Question 10 English

Suppose that the transaction $$T1$$ fails immediately after time instance $$9.$$ Which one of the following statements is correct?

A
$$T2$$ must be aborted and then both $$T1$$ and $$T2$$ must be re-started to ensure transaction atomicity
B
Schedule $$S$$ is non-recoverable and cannot ensure transaction atomicity
C
Only $$T2$$ must be aborted and then re-started to ensure transaction atomicity
D
Schedule $$S$$ is recoverable and can ensure atomicity and nothing else needs to be done
3
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?
A
r1(x); r2(x); w1(x); r3(x); w2(x)
B
r2(x); r1(x); w2(x); r3(x); w1(x)
C
r3(x); r2(x); r1(x); w2(x); w1(x)
D
r2(x); w2(x); r3(x); r1(x); w1(x)
4
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?
A
Only S1 is conflict-serializable.
B
Only S2 is conflict-serializable.
C
Both S1 and S2 are conflict-serializable.
D
Neither S1 nor S2 is conflict-serializable.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12