M

Mr. Dubey • 52.30K Points
Coach 

Q. Which of the following is not the algorithm to find the minimum spanning tree of the given graph?

(A) boruvka’s algorithm
(B) prim’s algorithm
(C) kruskal’s algorithm
(D) bellman–ford algorithm
Correct : Option (D)

Explanation: 
 the boruvka’s algorithm, prim’s algorithm and kruskal’s algorithm are the algorithms that can be used to find the minimum spanning tree of the given graph. the bellman-ford algorithm is used to find the shortest path from the single source to all other vertices.

Share

Discusssion

Login to discuss.

Related MCQs

Q. 7 If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. T

Q. To remove a relation from an SQL database, we use the command.

Q. Let p denote the statement: “Gopal is tall”, q: “Gopal is handsome”. Then the negation of the statement Gopal is tall, but not

Q. Which is an example of a web document?

Q. In arithmetic coding a ___identifier or tag is generated for the sequence to be encoded.

Q. A D flip-flop can be constructed from an _ flip-flop.

Q. ______ can be comparison-based or noncomparison-based.

Q. From the following given tree, what is the computed codeword for ‘c’?

Q. The time complexity of quick sort is …………..

Q. IMB launched its first personal computer called IBM-PC in 1981. It had chips from Intel, disk drives from Tandon, operating system from Microsoft, the