- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following is not the algori...

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 |

Answer» D. bellman–ford algorithm | |

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. |

View all MCQs in:
Design and Analysis of Algorithms

- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
- Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?
- Every graph has only one minimum spanning tree.
- Which of the following is false in the case of a spanning tree of a graph G?
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- How many spanning trees does a complete bipartite graph contain?
- Consider the graph shown below. Which of the following are the edges in the MST of the given graph?

Login to Continue

It will take less than 2 minutes

Report MCQ