Algorithms - Minimum Spanning Tree

page 1 out of 3

page 1 out of 3

Question 1     

A minimum spanning tree is a special kind of tree that minimizes the lengths (or “weights”) of the edges of the tree.

Question 2     

  A complete graph having n edges may have how many numbers of spanning tress?

Question 3     

Spanning tree doesn’t have any cycles

Question 4     

Algorithms for constructing Spanning tree algorithms

Question 5     

By using minimum spanning tree we can solve the travelling salesman problem?

Question 6     

There will be more than one spanning tree for the given graph

Question 7     

Every graph is a minimum spanning tree

Question 8     

Minimum spanning tree is a spanning tree with the lowest cost among all the spacing trees.

Question 9     

Spanning trees are always cyclic

Question 10     

Prim’s algorithm also called as

page 1 out of 3

page 1 out of 3

Sign Up Page


To view the solution need to Login

Score : 0 / 0