阿摩線上測驗
登入
阿摩線上測驗
登入
試卷名稱：110年 - 110 國立臺灣大學_碩士班招生考試_電信工程研究所丙組:資料結構與演算法(B)#113108
年份：110年
科目：研究所、轉學考(插大)◆資料結構與演算法
15. Consider the problem of making change for n cents using the fewest number of coins. An algorithm to solve this problem
is to give the coin with the highest available denomination without going over, and repeat the process until the amount of
remaining change drops to O. Which of the following sets of available coin denominations would cause this algorithm to
fail at yielding an optimal solution?
(A) {1,3}
(B) {1,3,4,5}
(C) {1,5,10, 25}
(D) {c0,c1,..,..ck) for any set of integers c > 1 and k ≥1
