卷別

資料結構與演算法

選擇

國立臺灣大學 2023 · 考試 · 第 9 題

(5 points) DFS advantages: To find a feasible solution to the eight-queen problem, what is/are the reason(s) that we prefer to use DFS (depth-first search) instead of BFS (breadth-first search)?

(A)
DFS is more memory efficient.
(B)
DFS can be implemented using a stack.
(C)
DFS usually reaches the terminal states of "good" or "bad" faster.
(D)
DFS is conceptually simpler than BFS.
(E)
BFS cannot be implemented using a stack.

標準解析

AI 已複查