Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gatecse-2012
50
votes
2
answers
61
GATE CSE 2012 | Question: 5
The worst case running time to search for an element in a balanced binary search tree with $n2^{n}$ elements is $\Theta(n\log n)$ $\Theta(n2^n)$ $\Theta(n)$ $\Theta(\log n)$
The worst case running time to search for an element in a balanced binary search tree with $n2^{n}$ elements is$\Theta(n\log n)$$\Theta(n2^n)$$\Theta(n)$$\Theta(\log n)$
gatecse
13.5k
views
gatecse
asked
Aug 5, 2014
DS
gatecse-2012
data-structures
normal
binary-search-tree
+
–
23
votes
4
answers
62
GATE CSE 2012 | Question: 4
Assuming $P \neq NP$, which of the following is TRUE? $NP- \ complete = NP$ $NP-complete \cap P = \phi$ $NP-hard = NP$ $P = NP-complete$
Assuming $P \neq NP$, which of the following is TRUE?$NP- \ complete = NP$$NP-complete \cap P = \phi$$NP-hard = NP$$P = NP-complete$
gatecse
9.0k
views
gatecse
asked
Aug 5, 2014
Theory of Computation
gatecse-2012
theory-of-computation
p-np-npc-nph
+
–
40
votes
5
answers
63
GATE CSE 2012 | 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 ... : printf ("No Choice"); } No Choice Choice A Choice A Choice B No Choice Program gives no output as it is erroneous
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 ("Choic...
gatecse
10.9k
views
gatecse
asked
Aug 5, 2014
Programming in C
gatecse-2012
programming
easy
programming-in-c
switch-case
+
–
47
votes
5
answers
64
GATE CSE 2012 | Question: 2
Which of the following is TRUE? Every relation in $\text{3NF}$ is also in $\text{BCNF}$ A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ is fully functionally dependent on every key of $R$ Every relation in $\text{BCNF}$ is also in $\text{3NF}$ No relation can be in both $\text{BCNF}$ and $\text{3NF}$
Which of the following is TRUE?Every relation in $\text{3NF}$ is also in $\text{BCNF}$A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ ...
gatecse
19.8k
views
gatecse
asked
Aug 5, 2014
Databases
gatecse-2012
databases
easy
database-normalization
+
–
33
votes
5
answers
65
GATE CSE 2012 | Question: 1
Consider the following logical inferences. $I_{1}$: If it rains then the cricket match will not be played. The cricket match was played. Inference: There was no rain. $I_{2}$: If it rains then the cricket match will not be played. It did not rain. Inference: ... $I_{2}$ is a correct inference Both $I_{1}$ and $I_{2}$ are not correct inferences
Consider the following logical inferences.$I_{1}$: If it rains then the cricket match will not be played.The cricket match was played.Inference: There was no rain.$I_{2}...
gatecse
9.2k
views
gatecse
asked
Aug 5, 2014
Mathematical Logic
gatecse-2012
mathematical-logic
easy
logical-reasoning
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register