32. If Dijkstra algorithm is implemented with Binomial heap as priority qucue, then the complexity is
(A) O(|V|²+|E| log|V|)
(B) O(|V|²)
(C) O(|E| log|V|)
(D) O(|E|  ||+|V| log|V|)
(E) O(|E|)

10. If Dijkstra algorithm is implemented with doubly-linked list as priority qucue, then the complexity is (A)O(|V|2+|E|log|V|)(B)O(|V|2) (C) O|E| log|V|)(D)O(|E|+|V|(log|V|) (E) O(|E|)

33. If Dijkstra algorithm is implemented with Fibonacci heap as priority queue, then the complexity is (A) O(|V|2+|E| log |V|) (B) O(|V|2) (C) O(|E| log|V|) (D) O(|E|+I|V| log(|V|) (E) O(|E|)

34. If Dijkstra algorithn is implemented with binary heap as priority queue, then the complexity is (A) O(|V|2+[IEl log|V|) (B) O(|V|2) (C) O(|E|log|V|) (D)O(|E|+|V|logIV|) (E) O(|E|)

35. If Dijkstra algorithm is implemented with doubly-linked Iist as prionity qucue, then the complexity is (A) O(|V|2+1Ellog|V|) (B) O(|V|2) (C) O(|E|log|V|) (D) O(|E|+|V| log|V|) (E) O(|E|)

複選題36. Which of the following statements are true? (A) [logn]! = 0(n2) (B) (logn)n = 0(n!) (C) log(n!) = O(nlogn) (D) log* n = O(log *logn) (E)

複選題37. Which of the following statements are true? (A) Stack implements a FIFO (first-in-first-out) policy. (B) Queue implements a LIFO (last-in-first-out) policy. (C) Stack can be realized by deque (double-ended qucue). (D) The Find() operation in a doubly linked list takes O(n) time. (E) The EnqueueO operation in a queue takes O(1) time.

複選題38. Consider a binary scarch tree that results from successively inserting keys 2, 8, 9, 1, 5. 7, 6, 3, 4 into an initially empty tree. Which of the following statements are true? (A) The tree height is 4. (B) Key 8 is prior to key 3 in terms of pre-order traversal. (C) Key 2 is prior to key 7 in terns of post-order traversal. (D) Key 4 is prior to key 5 in terms of in-order traversal. (E) Key 3 and key 9 are siblings.

複選題39. Which of the following are balanced search trees? (A) Binary search tree (B) Red-black trec (C) AVL tree (D) 2-3-4 tree (E) Splay tree

複選題40. Which of the following statem ents are true? (A) An insertion in AVL tree requires Ω(logn) single- and double-rotations in the worst case. (B) An insertion in AVL trce requires O(1) single- and double-rotations in the worst case. (C) A deletion in AVL tree requires Ω(logn) single- and double-rotations in the worst case. (D) Adeletion in AVL tree requires O(1) singie- and double-rotations in the worst case. (E) There is no red left child in AA tree.

複選題41. Consider an AVL tree that results from successively inserting keys 2, 4, 5, 3, 8, 7, 1, 6, 9 into an initially empty tree. Which of the following statements are true? (A) The tree height is 4. (B) Key 3 and key 5 have the same depth. (C) Key 2 and key 8 have the same height. (D) Key 6 is a leaf. (E) Key 7 is the parent ofkey 9.

110年 - [非官方正解]110 國立臺灣大學_碩士班招生考試_電信工程研究所丙組:資料結構與演算法(B)#113108

110年 - [非官方正解]110 國立中央大學_碩士班招生考試_資工類：資料結構與演算法#105890

109年 - 109 東吳大學_轉學生招生考試_資訊管理學系三年級︰資料結構#105850

104年 - [非官方正解]104 國立交通大學_碩士班考試入學試題_資訊聯招：資料結構與演算法#113199