1
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The recurrence equation
T(1) = 1
T(n) = 2T(n - 1)+n, $$n \ge 2$$
Evaluates to
A
2n+1 - n - 2
B
2n - n
C
2n+1 - 2n - 2
D
2n + n
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The elements 32, 15, 20, 30, 12, 25, 16, are inserted one by one in the given order into a max Heap. The resultant max Heap is
A
GATE CSE 2004 Algorithms - Searching and Sorting Question 22 English Option 1
B
GATE CSE 2004 Algorithms - Searching and Sorting Question 22 English Option 2
C
GATE CSE 2004 Algorithms - Searching and Sorting Question 22 English Option 3
D
GATE CSE 2004 Algorithms - Searching and Sorting Question 22 English Option 4
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge-weighted directed graph with vertex P as the source.
GATE CSE 2004 Algorithms - Greedy Method Question 26 English In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized?
A
$$P,Q,R,S,T,U$$
B
$$P,Q,R,U,S,T$$
C
$$P,Q,R,U,T,S$$
D
$$P,Q,T,R,U,S$$
4
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of
A
n
B
n2
C
n log n
D
$$n \log^2n$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12