1
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?
T(1) = 2T (n/2) + log n
A
$$\theta (n)$$
B
$$\theta (n \log n)$$
C
$$\theta (n^2)$$
D
$$\theta (\log n)$$
2
GATE CSE 2014 Set 2
Numerical
+2
-0
Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.
Your input ____
3
GATE CSE 2014 Set 2
Numerical
+2
-0
Consider two strings A = “qpqrr” and B = “pqprqrp”. Let x be the length of the longest common subsequence (not necessarily contiguous) between A and B and let y be the number of such longest common subsequences between A and B. Then x + 10y = ___.
Your input ____
4
GATE CSE 2014 Set 2
Numerical
+2
-0
The number of distinct minimum spanning trees for the weighted graph below is ________ GATE CSE 2014 Set 2 Algorithms - Greedy Method Question 11 English
Your input ____
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12