Question 1
The question(s) that follow refer to the problem of finding the minimum spanning tree for the weighted network shown below.
The total weight of the minimum spanning tree is
◦ 36.
◦ 95.
◦ 55.
◦ 42.
◦ none of these
Question 2
Which of the following statements is true about Kruskal's algorithm.
◦ It is an inefficient algorithm, and it never gives the minimum spanning tree.
◦ It is an efficient algorithm, but it doesn't always give the minimum spanning tree.
◦ It is an efficient algorithm, and it always gives the minimum spanning tree.
◦ It is an inefficient algorithm, but it always gives the minimum spanning tree.
◦ none of these
A true albino squirrel. Note the pink eyes.
true story
True Friendship
Algorithm for Hypertension
True Dover Sole