Engineering Online MCQ Number 0572 – online study, assignment and exam

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 Complete Homework, Premium 1 Day Pass, Premium 1 Month, and Premium 6 Months members only.
Log In Visit Now