M

Mr. Dubey • 97.86K Points
Coach

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

  • (A) greedy algorithm
  • (B) dynamic programming
  • (C) divide and conquer
  • (D) backtracking
Share
Explanation by: Mr. Dubey
the coin change problem has overlapping subproblems(same subproblems are solved multiple times) and optimal substructure(the solution to the problem can

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The alternate solution for a demultiplexer-register combination circuit is

Q. Automatic protection switching in linear network is defined at the _______

Q. Problems that cannot be solved by any algorithm are called?

Q. Aperiodic stimuli is

Q. Unit testing is done by

Q. plays area turn into an interactive game?

Q. In an M-ary signalling scheme two or more bits are grouped together to form a

Q. The ROM chips are mainly used to store

Q. The situation where the lock waits only for a specified amount of time for another lock to be released is

Q. The following specializations exist in digital investigations:

Question analytics