1
GATE CSE 2014 Set 1
Numerical
+2
-0
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is ________
Your input ____
2
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider the following pseudo code. What is the total number of multiplications to be performed?
D = 2
for i = 1 to n do
   for j = i to n do
      for k = j + 1 to n do
           D = D * 3
A
Half of the product of the 3 consecutive integers.
B
One-third of the product of the 3 consecutive integers.
C
One-sixth of the product of the 3 consecutive integers.
D
None of the above.
3
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?
A
GATE CSE 2014 Set 1 Algorithms - P and NP Concepts Question 3 English Option 1
B
GATE CSE 2014 Set 1 Algorithms - P and NP Concepts Question 3 English Option 2
C
GATE CSE 2014 Set 1 Algorithms - P and NP Concepts Question 3 English Option 3
D
GATE CSE 2014 Set 1 Algorithms - P and NP Concepts Question 3 English Option 4
4
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is FALSE?
A
A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end.
B
Available expression analysis can be used for common subexpression elimination.
C
Live variable analysis can be used for dead code elimination
D
$$x = 4*5 \Rightarrow x = 20$$ is an example of common subexpression elimination
EXAM MAP