- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Kadane’s algorithm uses which of the fol...

Q. |
## Kadane’s algorithm uses which of the following techniques? |

A. | divide and conquer |

B. | dynamic programming |

C. | recursion |

D. | greedy algorithm |

Answer» B. dynamic programming | |

Explanation: kadane’s algorithm uses dynamic programming. |

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?
- Recursive program to raise an integer x to power y uses which of the following algorithm?
- The dynamic programming implementation of the maximum sum rectangle problem uses which of the following 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.

Login to Continue

It will take less than 2 minutes

Report MCQ