1
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?
A
Every minimum spanning tree of G must contain emin
B
If emax is in a minimum spanning tree, then its removal must disconnect G
C
No minimum spanning tree contains emax
D
G has a unique minimum spanning tree
2
GATE CSE 1992
Fill in the Blanks
+2
-0
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is _______.
3
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)$$
4
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 14 English
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12