ExamSIDE.Com

© ExamSIDE.Com 2019

About Us Privacy Policy

GATE CSE 1991 Question

Mulitple Correct Answer
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)$$

GATE CSE 1991 Question

Integer Type Question
The weighted external path length of the binary tree in figure is ___________.
Your Input is ____
1
2
3
4
5
6
7
8
9
.
0
-

GATE CSE 1992 Question

Answer by Yourself
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 _______.

GATE CSE 2000 Question

Signle Correct Answer
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

Share