MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
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<sup>2</sup>) |
| D. | O(S*N) |
| Answer» D. O(S*N) | |