What Do You Know About The Change Making Problem?

10 Questions | Total Attempts: 105

SettingsSettingsSettings
Please wait...
What Do You Know About The Change Making Problem?

Whether you call it the change-making problem or the minimum coin change problem, this problem is the most popular variation of the coin change problem and deals with finding the minimum number of a particular form of currency that sums up to a certain amount of money. In addition to currency, the change-making problem is also applicable in a number of areas.


Questions and Answers
  • 1. 
    What is another name for the change-making problem?
    • A. 

      Absolute coin problem

    • B. 

      Maximum coin weight problem

    • C. 

      Minimum coin problem

    • D. 

      Minimum coin change problem

  • 2. 
    What type of problem is the change-making problem?
    • A. 

      Ring puzzle

    • B. 

      Knapsack

    • C. 

      Tile puzzle

    • D. 

      Coin weight

  • 3. 
    What can be used to solve the change-making problem? 
    • A. 

      Skill programming

    • B. 

      Plotting graphs

    • C. 

      Dynamic programming

    • D. 

      Abstract algebra

  • 4. 
    Which is a feature of the change-making problem?
    • A. 

      Optimal substructure

    • B. 

      Substructure

    • C. 

      Time

    • D. 

      Length

  • 5. 
    What is the numeric value of the input in a numeric algorithm? The...​
    • A. 

      Length

    • B. 

      Order

    • C. 

      Bit

    • D. 

      Largest integer present

  • 6. 
    Which is a feature of the change-making problem?
    • A. 

      Weakly - NP complete

    • B. 

      Weakly - NP hard

    • C. 

      Weakly - NP dond

    • D. 

      NP - complete

  • 7. 
    Which of these is not considered in a change-making problem?
    • A. 

      Length

    • B. 

      Bit

    • C. 

      Order

    • D. 

      Input

  • 8. 
    In a numeric algorithm, what do we call the number of bits required to represent the input? ​​​​​​The... 
    • A. 

      Length

    • B. 

      Width

    • C. 

      Byte

    • D. 

      Code

  • 9. 
    Which is the task of deciding whether a given multiset of positive integers can be partitioned into two subsets such that the sum of the numbers in the first subset equals the sum of the numbers in the second subset?
    • A. 

      Set theory

    • B. 

      Partitioning

    • C. 

      Segmentation

    • D. 

      Personalizing

  • 10. 
    Which is an application of the change-making problem?
    • A. 

      Nine dart finish

    • B. 

      Soma cube

    • C. 

      Colour chart

    • D. 

      Colour cube

Back to Top Back to top