M

Mr. Dubey • 100.69K Points
Coach

Q. Which of the following is true?

  • (A) prim’s algorithm can also be used for disconnected graphs
  • (B) kruskal’s algorithm can also run on the disconnected graphs
  • (C) prim’s algorithm is simpler than kruskal’s algorithm
  • (D) in kruskal’s sort edges are added to mst in decreasing order of their weights
Share
Explanation by: Mr. Dubey
prim’s algorithm iterates from one node to another, so it can not be applied for disconnected graph. kruskal’s algorithm can be applied to the disconnected graphs to construct the minimum cost forest. kruskal’s algorithm is comparatively easier and simpler than prim’s algorithm.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The regular sets are closed under:

Q. --------- The degree to which standard interfaces protocols and bandwidth are used.

Q. Which of the following commands will create a list?

Q. A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

Q. A lock that allows concurrent transactions to access different rows of the same table is known as a

Q. TCP/IP model was developed _____ the OSI model.

Q. Which of the following is a transport layer protocol?

Q. clustering technique start with as many clusters as there are records, with each cluster having only one record

Q. Uses cases are represented as ________ within the system rectangle.

Q. A good mapping does not depends on which following factor

Question analytics