Q. 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 NOT produce an optimal answer?

View solution

Q. 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?

View solution

Q. You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?

View solution

Q. Suppose you are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the space complexity of a dynamic programming implementation used to solve the coin change problem?

View solution

Q. You are given infinite coins of denominations 1, 3, 4. What is the total number of ways in which a sum of 7 can be achieved using these coins if the order of the coins is not important?

View solution

Q. You are given infinite coins of denominations 1, 3, 4. What is the minimum number of coins required to achieve a sum of 7?

View solution

Q. You are given infinite coins of denominations 5, 7, 9. Which of the following sum CANNOT be achieved using these coins?

View solution

Q. You are given infinite coins of denominations 3, 5, 7. Which of the following sum CAN be achieved using these coins?

View solution

Q. Given a one-dimensional array of integers, you have to find a sub-array with maximum sum. This is the maximum sub-array sum problem. Which of these methods can be used to solve the problem?

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. 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