Coin Change Problem : Data Structure And Algorithm MCQ Practice Questions & Answers (English)

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

1.

You are given infinite coins of denominations 3, 5, 7. Which of the following sum CANNOT be achieved using these coins?

A

15

B

16

C

17

D

4

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

2.

You are given infinite coins of denominations 5, 7, 9. Which of the following sum CANNOT be achieved using these coins?

A

50

B

21

C

13

D

23

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

3.

You are given infinite coins of denominations 1, 3, 4. What is the minimum number of coins required to achieve a sum of 7?

A

1

B

2

C

3

D

4

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

4.

You are given infinite coins of denominations 1, 3, 4. What is the total number of ways in which a sum of 7 can be achieved using these coins if the order of the coins is not important?

A

4

B

3

C

5

D

6

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

5.

Suppose you are given infinite coins of N 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. What is the space complexity of a dynamic programming implementation used to solve the coin change problem?

A

O(N)

B

O(S)

C

O(N^{2})

D

O(S*N)

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

6.

You are given infinite coins of N 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. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?

A

O(N)

B

O(S)

C

O(N^{2})

D

O(S*N)

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

7.

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

100

Correct Answer:

(D) 100

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

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

8.

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?

A

20

B

12

C

6

D

5

Data Structure And AlgorithmMediumDynamic ProgrammingCoin Change Problem

9.

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

Coin Change Problem in Data Structure And Algorithm : Practice MCQ Questions & Answers with Explanations