DT Q25

Common Data for Q. 25 & Q. 26

Suppose the letters a, b, c, d, e have probabilities
respectively

0. For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim's algorithm to construct a Minimum Spanning Tree?

  • Option : C
  • Explanation :

    In prims algorithm we can select arbitary vertex and them, find all the edges that connect the tree to new vertex and find the minimum and add it to the tree. So option “C” is correct
    (d, f), C), (d, a), (a, b), (c, e), (F, h), (g, h) (g, i).
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *