adplus-dvertising
frame-decoration

Question

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

a.

50

b.

21

c.

13

d.

23

Answer: (c).13

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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?

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

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

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

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

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

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

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

Q. Kadane’s algorithm is used to find ____________

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

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

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

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

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

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 __________

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

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

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

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