☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch7 貪婪演算法
第 11 題／共 12 題
◀
AL 11/12
錯題回報
00:00
11. Greedy Algorithm
#AL-07-011
中
Greedy Algorithm
📝
☆
Which of the following statements about greedy algorithms are true?
A
A greedy algorithm is correct only if the problem satisfies both the greedy-choice property and optimal substructure.
B
The fractional knapsack problem can be optimally solved using a greedy strategy, whereas the 0/1 knapsack problem cannot.
C
Dijkstra's shortest-path algorithm fails to produce correct results if the graph contains edges with negative weights.
D
Every problem that can be solved using dynamic programming can also be solved optimally using a greedy algorithm.
E
Prim's and Kruskal's algorithms are greedy algorithms for finding a minimum spanning tree.
📝 寫筆記
📄 中央115
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch7 貪婪演算法
‹
本章題號 · 1–12 / 12
›
全部 12
易 4
中 8
難 0
1
2
3
4
5
6
7
8
9
10
11
12
