- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Kadane’s algorithm is used to find

Q. |
## Kadane’s algorithm is used to find |

A. | longest increasing subsequence |

B. | longest palindrome subsequence |

C. | maximum sub-array sum |

D. | longest decreasing subsequence |

Answer» C. maximum sub-array sum | |

Explanation: kadane’s algorithm is used to find the maximum sub-array sum for a given array. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
- What is the time complexity of the brute force algorithm used to find the longest common subsequence?
- What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?
- 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