Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
Prim’s algorithm resembles Dijkstra’s algorithm.
Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
Which of the following statements are true? (A) An algorithm may produce no output (B) An algorithm expressed in a programming language is called a computer program. (C) An algorithm is expressed in a graphical form known as a flowchart (D) An algorithm can have an infinite sequence of instructions. Choose the correct answer from the options given below:
Consider the undirected graph below: Using Prim's algorithm to construct a minimum spanning tree starting with node a, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?
Which of the following statement is false about Prim’s algorithm?
Consider the given graph. What is the weight of the minimum spanning tree using the Prim’s algorithm,starting from vertex a?
Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
Consider the graph shown below. Which of the following edges form the MST of the given graph using Prim’a algorithm, starting from vertex 4.
Prim’s algorithm is also known as __________