☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch3 動態規劃
第 36 題／共 40 題
◀
AL 36/40
錯題回報
00:00
36. Dynamic Programming
#AL-03-036
易
Dynamic Programming
📝
☆
Choose correct statement(s):
A
Dynamic programming is used to solve problems that can be broken down into overlapping subproblems.
B
The Longest Common Subsequence (LCS) problem can be solved by dynamic programming with a time complexity of
O
(
m
+
n
)
O(m+n)
O
(
m
+
n
)
, where
m
m
m
and
n
n
n
are the lengths of the two sequences.
C
Dynamic programming always uses a 2D table for storing intermediate results.
D
In dynamic programming, memoization stores solutions to subproblems to avoid redundant computations.
E
Dynamic programming can only be applied to problems with a greedy choice property.
📝 寫筆記
📄 中央114
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃
‹
本章題號 · 21–40 / 40
›
全部 40
易 18
中 17
難 5
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
