1
GATE CSE 1991
MCQ (More than One Correct Answer)
+2
-0.6
Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph G with n vertices and m edges has the time complexity of:
A
$$O(n^{2})$$
B
O(mn)
C
$$O(m^2)$$
D
$$O(m \log n)$$
2
GATE CSE 1991
Subjective
+2
-0
Obtain the optimal binary search tree with equal probabilities for the identifier set (a1, a2, a3) = ( if, stop, while)
3
GATE CSE 1991
Numerical
+2
-0
The weighted external path length of the binary tree in figure is ___________. GATE CSE 1991 Algorithms - Greedy Method Question 12 English
Your input ____
4
GATE CSE 1991
MCQ (Single Correct Answer)
+2
-0.6
The following sequence of operations is performed on stack: PUSH (10),PUSH (20),POP,PUSH (10),PUSH (20),POP,POP,POP,PUSH (20),POP The sequence of the value popped out is:
A
20,10,20,10,20
B
20,20,10,10,20
C
10,20,20,10,20
D
20,20,10,20,10
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12