1
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
For parameters a and b, both of which are $$\omega \left( 1 \right)$$,
T(n) = $$T\left( {{n^{1/a}}} \right) + 1$$, and T(b) = 1.
Then T(n) is
A
$$\Theta \left( {{{\log }_a}{{\log }_b}n} \right)$$
B
$$\Theta \left( {{{\log }_{ab}}n} \right)$$
C
$$\Theta \left( {{{\log }_b}{{\log }_a}n} \right)$$
D
$$\Theta \left( {{{\log }_2}{{\log }_2}n} \right)$$
2
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
Let G = (V, E) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighted edge (u, v) $$ \in $$ V $$ \times $$ V is added to G. The worst case time complexity of determining if T is still an MST of the resultant graph is
A
$$\Theta \left( {\left| E \right| + \left| V \right|} \right)$$
B
$$\Theta \left( {\left| E \right|\left| V \right|} \right)$$
C
$$\Theta \left( {\left| E \right|\log \left| V \right|} \right)$$
D
$$\Theta \left( {\left| V \right|} \right)$$
3
GATE CSE 2020
Numerical
+2
-0.67
Consider a graph G = (V, E), where V = {v1, v2, ...., v100},
E = {(vi, vj) | 1 ≤ i < j ≤ 100}, and weight of the edge (vi, vj) is |i - j|. The weight of the minimum spanning tree of G is ______.
Your input ____
4
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Consider the following statements.

I. Symbol table is accessed only during lexical analysis and syntax analysis.
II. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment.
III. Errors violating the condition ‘any variable must be declared before its use’ are detected during syntax analysis.

Which of the above statements is/are TRUE?
A
I and III only
B
II only
C
I only
D
None of I, II and III
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12