Q. Find the maximum sub-array sum for the given elements.
{2, -1, 3, -4, 1, -2, -1, 5, -4}

View solution

Q. Find the maximum sub-array sum for the given elements.
{-2, -1, -3, -4, -1, -2, -1, -5, -4}

View solution

Q. What is the time complexity of the naive method used to find the maximum sub-array sum in an array containing n elements?

View solution

Q. What is the space complexity of the naive method used to find the maximum sub-array sum in an array containing n elements?

View solution

Q. What is the time complexity of the divide and conquer algorithm used to find the maximum sub-array sum?

View solution

Q. What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?

View solution

Q. Find the maximum sub-array sum for the following array:
{3, 6, 7, 9, 3, 8}

View solution

Q. Kadane’s algorithm is used to find ____________

View solution

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

View solution

Q. For which of the following inputs would Kadane’s algorithm produce the CORRECT output?

View solution

Q. For which of the following inputs would Kadane’s algorithm produce a WRONG output?

View solution

Q. What is the time complexity of Kadane’s algorithm?

View solution

Q. What is the space complexity of Kadane’s algorithm?

View solution

Q. The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using __________

View solution

Q. Find the longest increasing subsequence for the given sequence:
{10, -10, 12, 9, 10, 15, 13, 14}

View solution

Q. Find the length of the longest increasing subsequence for the given sequence:
{-10, 24, -9, 35, -21, 55, -41, 76, 84}

View solution

Q. For any given sequence, there will ALWAYS be a unique increasing subsequence with the longest length.

View solution

Q. The number of increasing subsequences with the longest length for the given sequence are:
{10, 9, 8, 7, 6, 5}

View solution

Q. In the brute force implementation to find the longest increasing subsequence, all the subsequences of a given sequence are found. All the increasing subsequences are then selected and the length of the longest subsequence is found. What is the time complexity of this brute force implementation?

View solution

Q. Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?

View solution