Suppose you have coins of denominations 1, 3 and 4. You - Practice (English)

Loading practice questions

A focused practice platform for competitive-exam MCQs, subject wise, topic wise practice, and current affairs revision.

Exams

SSC CGL
UPSC CSE PRELIMS
IBPS PO
RRB NTPC
CDS

Subjects

Mathematics
Physics
General Knowledge
English
Reasoning

Resources

Current Affairs
Search MCQs
Practice Sets

Company

About Us
Contact
Privacy Policy
Terms of Use
Disclaimer
Copyright

Practice library for exams, subjects, and daily revision. For learning purposes only.

Suppose you have coins of denominations 1, 3 and 4. You - Practice (English) | ObjectiveMcq

PracticeData Structure And AlgorithmDynamic ProgrammingSuppose you have coins of denominat...

Dynamic Programming Data Structure And AlgorithmMedium

1,175 views

Suppose you have coins of denominations 1, 3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm NOT produce an optimal answer?

Correct Answer: C — 6

Explanation:

Using the greedy algorithm, three coins {4,1,1} will be selected to make a sum of 6. But, the optimal answer is two coins {3,3}.

Related Practice

How many constraints does flow have?
What is the running time of Dinic's blocking flow algorithm?
Who formulated the Maximum flow problem?
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
Dinic's algorithm runs faster than the Ford-Fulkerson algorithm.
In what time can an augmenting path be found?
A simple acyclic path between source and sink which passes through only positive weighted edges is called?
Under what condition can a vertex combine and distribute flow in any manner?