GATE CSE 2012


Question 1
Consider the following logical inferences. I1: If it rains then the cricket match will not be played.
The cricket match was played.
Inference: There was no rain.
I2: If it rains then the cricket match will not be played.
It did not rain.
Inference: The cricket match was played.

Which of the following is TRUE?
A
Both I1 and I2 are correct inferences
B
I1 is correct but I2 is not a correct inference
C
I1 is not correct but I2 is a correct inference
D
Both I1 and I2 are not correct inferences
Discrete Mathematics   Propositional Logic
Question 2
Which of the following is TRUE?
A
Every relation in 3NF is also in BCNF
B
A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
C
Every relation in BCNF is also in 3NF
D
No relation can be in both BCNF and 3NF
Database Management System   Normal Form


Question 3
What will be the output of the following C program segment? 
 char inChar = 'A' ;
switch ( inChar ) {
case 'A' : printf ("Choice A\ n") ;
case 'B' :
case 'C' : printf ("Choice B") ;
case 'D' :
case 'E' :
default : printf ( " No Choice" ) ; }
A
No Choice
B
Choice A
C
Choice A
Choice B No Choice
D
Program gives no output as it is erroneous
C Programming   Conditional Statement
Question 4
Assuming P \neq NP, which of the following is TRUE?
A
NP-complete = NP
B
NP-complete \cap P = \phi
C
NP-hard = NP
D
P = NP-complete
Algorithm   P-NP Theory
Question 5
The worst case running time to search for an element in a balanced binary search tree with n2^{n} elements is
A
\Theta (n log n)
B
\Theta n2^{n}
C
\Theta (n)
D
\Theta (log n)
Data Structure   AVL Tree




There are 5 questions to complete.

Leave a Comment