Multiple choice question for engineering Set 1 1. 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…
This content is for paid premium members only.
You can view complete answer after activation your membership.
Need only one answers. Simply buy single day pass and email. We will send answers for this question.
Login Buy membership