Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.

Home / Engineering / Design and Analysis of Algorithms / Question

Mr. Dubey • 51.43K Points
Coach

Q.) Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.

(A) true

(B) false

(D) ---

Correct answer : Option (B) - false

Explanation:

 prim’s algorithm outperforms the kruskal’s algorithm in case of the dense graphs. it is significantly faster if graph has more edges than the kruskal’s algorithm.

Discusssion

Related MCQs on Design and Analysis of Algorithms

Q. Boom Limited gives due weightage to the perquisites and prestige of job so that the designation helps to satisfy the psychological, social and esteem needs of an individual. Identify the type of incentive being described in the above lines.

Q. If we want to retain all duplicates, we must write in place of union.

Q. What establishes the profile of end-users of the system?

Q. In a data transfer operation involving SCSI BUS, the control is with

Q. Full path name starts with …..

Q. Which of the following' is NOT a characteristic of good test data?

Q. Peer-to-Peer leads to the development of technologies like?

Q. What does command LS do

Q. Program that analyses and excecute each line of the source code in succession

Q. What happens if a local variable exists with the same name as the global variable you want to access?