6. When using Breadth-First Search (BFS), which data structure is typically used to keep track of thecurrent search nodes?(A) Queue (B) Hash Table(C) Heap (D) Stack

6. When using Breadth-First Search (BFS), which data structure is typically used to keep track of thecurrent search nodes?
(A) Queue
(B) Hash Table
(C) Heap
(D) Stack

答案：登入後查看
統計： 尚無統計資料

詳解 (共 1 筆)

MoAI - 您的AI助手

B1 · 2026/10/01

#7521577

考試重點觀念本題測驗的是 BFS（廣度...

(共 1224 字，隱藏中）

前往觀看

7. Which of the following statements about time complexity is correct?(A) When analyzing the time complexity of an algorithm, we count the number of executions of its keysteps. Using different key steps may lead to different results.(B) In time complexity analysis, the best case is always smaller than the worst case.(C) If Algorithm A has a higher time complexity than Algorithm B, then Algorithm A will always takemore time than Algorithm B for any input.(D) The Big-O notation describes the best-case time complexity of an algorithm.

6. When using Breadth-First Search (BFS), which data structure is typically used to keep track of thecurrent search nodes?
(A) Queue
(B) Hash Table
(C) Heap
(D) Stack

詳解 (共 1 筆)

相關試題

相關試卷

6. When using Breadth-First Search (BFS), which data structure is typically used to keep track of thecurrent search nodes?(A) Queue(B) Hash Table(C) Heap(D) Stack

詳解 (共 1 筆)

相關試題

相關試卷

6. When using Breadth-First Search (BFS), which data structure is typically used to keep track of thecurrent search nodes?
(A) Queue
(B) Hash Table
(C) Heap
(D) Stack