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 produce an optimal answer?(a) 14(b) 10(c) 6(d) 100The question was asked in my homework.The query is from Coin Change Problem topic in chapter Dynamic Programming of Data Structures & Algorithms II

Suppose you have coins of denominations 1,3 and 4. You use a greedy al

1.	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 produce an optimal answer?(a) 14(b) 10(c) 6(d) 100The question was asked in my homework.The query is from Coin Change Problem topic in chapter Dynamic Programming of Data Structures & Algorithms II
Answer» Correct CHOICE is (d) 100 The best I can explain: 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}. Similarly, four coins {4,4,1,1} will be selected to make a sum of 10. But, the optimal answer is three coins {4,3,3}. ALSO, five coins {4,4,4,1,1} will be selected to make a sum of 14. But, the optimal answer is four coins {4,4,3,3}. For a sum of 100, twenty-five coins {all 4’s} will be selected and the optimal answer is also twenty-five coins {all 4’s}.

Discussion

No Comment Found

Related InterviewSolutions

What is the maximum number of ways in which a boolean expression with n + 1 terms can be parenthesized, such that the output is true?(a) nth catalan number(b) n factorial(c) n cube(d) n squareI have been asked this question during an interview.I'd like to ask this question from Counting Boolean Parenthesizations in section Dynamic Programming of Data Structures & Algorithms II
Which of the following gives the total number of ways of parenthesizing an expression with n + 1 terms?(a) n factorial(b) n square(c) n cube(d) nth catalan numberI had been asked this question in a job interview.My doubt is from Counting Boolean Parenthesizations in section Dynamic Programming of Data Structures & Algorithms II
Consider the expression T | F ∧ T. In how many ways can the expression be parenthesized so that the output is F (false)?(a) 0(b) 1(c) 2(d) 3This question was posed to me during an interview.My doubt stems from Counting Boolean Parenthesizations in portion Dynamic Programming of Data Structures & Algorithms II
Consider the expression T & F ∧ T.What is the number of ways in which the expression can be parenthesized so that the output is T (true)?(a) 0(b) 1(c) 2(d) 3This question was posed to me by my college professor while I was bunking the class.I need to ask this question from Counting Boolean Parenthesizations in division Dynamic Programming of Data Structures & Algorithms II
Consider the expression T & F | T. What is the number of ways in which the expression can be parenthesized so that the output is T (true)?(a) 0(b) 1(c) 2(d) 3The question was posed to me in a national level competition.The question is from Counting Boolean Parenthesizations in chapter Dynamic Programming of Data Structures & Algorithms II
You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols can be parenthesized so that the expression evaluates to true. This is the boolean parenthesization problem. Which of the following methods can be used to solve the problem?(a) Dynamic programming(b) Recursion(c) Brute force(d) Dynamic programming, Recursion and Brute forceI have been asked this question by my school teacher while I was bunking the class.I want to ask this question from Counting Boolean Parenthesizations in chapter Dynamic Programming of Data Structures & Algorithms II
There are 10 dice having 5 faces. The faces are numbered from 1 to 5. What is the number of ways in which a sum of 4 can be achieved?(a) 0(b) 2(c) 4(d) 8This question was addressed to me in an international level competition.My doubt stems from Dice Throw Problem in section Dynamic Programming of Data Structures & Algorithms II
There are n dice with f faces. The faces are numbered from 1 to f. What is the maximum possible sum that can be obtained when the n dice are rolled together?(a) 1(b) f*f(c) n*n(d) n*fThe question was asked in a national level competition.This key question is from Dice Throw Problem in division Dynamic Programming of Data Structures & Algorithms II
There are n dice with f faces. The faces are numbered from 1 to f. What is the minimum possible sum that can be obtained when the n dice are rolled together?(a) 1(b) f(c) n(d) n*fI got this question in a national level competition.My enquiry is from Dice Throw Problem in division Dynamic Programming of Data Structures & Algorithms II
You have 2 dice each of them having 6 faces numbered from 1 to 6. What is the number of ways in which a sum of 11 can be achieved?(a) 0(b) 1(c) 2(d) 3This question was posed to me during an interview for a job.Asked question is from Dice Throw Problem in division Dynamic Programming of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment