- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following is false about Pr...

Q. |
## Which of the following is false about Prim’s algorithm? |

A. | it is a greedy algorithm |

B. | it constructs mst by selecting edges in increasing order of their weights |

C. | it never accepts cycles in the mst |

D. | it can be implemented using the fibonacci heap |

Answer» B. it constructs mst by selecting edges in increasing order of their weights | |

Explanation: prim’s algorithm can be implemented using fibonacci heap and it never accepts cycles. and prim’s algorithm follows greedy approach. prim’s algorithms |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- Which of the following is false about the Kruskal’s algorithm?
- 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.
- Prim’s algorithm resembles Dijkstra’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.

Login to Continue

It will take less than 2 minutes

Report MCQ