1
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Consider the following schedule S of transactions T1, T2, T3, T4: GATE CSE 2014 Set 2 Database Management System - Transactions and Concurrency Question 21 English
A
S is conflict-serializable but not recoverable
B
S is not conflict-serializable but is recoverable
C
S is both conflict-serializable and recoverable
D
S is neither conflict-serializable not is it recoverable
2
GATE CSE 2014 Set 2
Numerical
+1
-0
Given an instance of the STUDENTS relation as shown below: GATE CSE 2014 Set 2 Database Management System - Er Diagrams Question 14 English

For (StudentName, StudentAge) to be a key for this instance, the value $$X$$ should NOT be equal to ________.

Your input ____
3
GATE CSE 2014 Set 2
Numerical
+1
-0
The maximum number of superkeys for the relation schema $$R(E, F, G, H)$$ with $$E$$ as key is ______.
Your input ____
4
GATE CSE 2014 Set 2
Numerical
+1
-0
Consider the equation $${\left( {123} \right)_5} = {\left( {x8} \right)_y}$$ with $$x$$ and $$y$$ as unknown. The number of possible solutions is _________.
Your input ____
EXAM MAP