1
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Suppose a database schedule $$S$$ involves transactions $${T_1},\,...,\,{T_n}.$$ Construct the precedence graph of $$S$$ with vertices representing the transactions and edges representing the conflicts. If $$S$$ is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?
A
Topological order
B
Depth-first order
C
Breadth-first order
D
Ascending order of transaction indices
2
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is NOT a part of the $$ACID$$ properties of database transactions?
A
Atomicity
B
Consistency
C
Isolation
D
Deadlock-freedom
3
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Consider the following transaction involving two bank accounts x and y.
read (x) ; x: = x - 50; write (x); read (y); y: = y + 50;   write (y)

The constraint that the sum of the accounts x and y should remain constant is that of

A
Atomicity
B
Consistency
C
Isolation
D
Durability
4
GATE CSE 2010
MCQ (Single Correct Answer)
+1
-0.3
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

I. 2-phase locking
II. Time-stamp ordering

A
I only
B
II only
C
Both I and II
D
Neither I nor II
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12