1
GATE CSE 2014 Set 2
Numerical
+2
-0
Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___. GATE CSE 2014 Set 2 Data Structures - Trees Question 44 English
Your input ____
2
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
A
A queue cannot be implemented using this stack.
B
A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.
C
A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.
D
A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each
3
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+2
-0.6
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below:
Select * from R where a in (select S.a from S)
A
Select R.* from R, S where R.a = S.a
B
Select distinct R.* from R, S where R.a = S.a
C
Select R.* from R, (select distinct a from S) as S1 where R.a = S1.a
D
Select R.* from R, S where R.a = S.a and is unique R
4
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 22 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