M

Mr. Dubey • 52.30K Points
Coach 

Q. Which of the following is true?

(A) prim’s algorithm initialises with a vertex
(B) prim’s algorithm initialises with a edge
(C) prim’s algorithm initialises with a vertex which has smallest edge
(D) prim’s algorithm initialises with a forest
Correct : Option (A)

Explanation: 
 steps in prim’s algorithm: (i) select any vertex of given graph and add it to mst (ii) add the edge of minimum weight from a vertex not in mst to the vertex in mst; (iii) it mst is complete the stop, otherwise go to step (ii).

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. ___________removes all rows from a table without logging the individual row deletions.

Q. The degree of vertex v in G is __________.

Q. What does D in the D-flip flop stand for?

Q. in a heuristic evaluation:

Q. Which design pattern provides a single class which provides simplified methods required by client and delagates call to those methods?

Q. Create a new file “new.txt” that is a concatenation of “file1.txt” and “file2.txt”

Q. Which among the following are valid questions raised for the top level architectural model?

Q. What are the advantages of Factory objects?

Q. For the frequently accessed HDFS files the blocks are cached in

Q. Which of the following is not supervised learning?