Coin Change Problem MCQ

Test your knowledge with important Coin Change Problem MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Coin Change Problem MCQs at Bissoy

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

  50

  খ

  21

  গ

  13

  ঘ

  23
• 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?
  ক

  O(N)

  খ

  O(S)

  গ

  O(N2)

  ঘ

  O(S*N)
• 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?
  ক

  O(N)

  খ

  O(S)

  গ

  O(N2)

  ঘ

  O(S*N)
• You are given infinite coins of 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. This problem can be solved using ____________
  ক

  Greedy algorithm

  খ

  Dynamic programming

  গ

  Divide and conquer

  ঘ

  Backtracking