- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Prim’s algorithm resembles Dijkstra’s al...

Q. |
## Prim’s algorithm resembles Dijkstra’s algorithm. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: in prim’s algorithm, the mst is constructed starting from a single vertex and adding in new edges to the mst that link the partial tree to a new vertex outside of the mst. and dijkstra’s algorithm also rely on the similar approach of finding the next closest vertex. so, prim’s algorithm |

View all MCQs in:
Design and Analysis of Algorithms

- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- The naive pattern searching algorithm is an in place algorithm.
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.
- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
- Dinic’s algorithm runs faster than the Ford-Fulkerson algorithm.

Login to Continue

It will take less than 2 minutes

Report MCQ