複選題
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.

複選題42. Consider the splay tree in Figure 1. Which of the following statements are true? (Assume bottom-up splay, also assume the Join0 operation splays on the maximum element in the left tree, which then attaches the right tree.) (A) In Figure I, after deleting key 26, then key 33 is a child of key 48. (B) In Figure I , after deleting key 26, then key 17 is the root. (C) In Figure I, after inserting key 75, then key 64 is an ancestor of key 99. (D) In Figure I, after inserting key 75, then key 33 is a descendant of key 55. (E) In Figure I, after inserting key 75, then key 75 is the root.

複選題43. Consider the red-black tree in Figure 2, which of the following statements are true? (Assume bottom-up insertion/deletion) (A) In Figure 2, after inserting key 14, then there are 6 red nodes. (B) In Figure 2, after inserting key 54, then key 49 and key 54 are siblings. (C) In Figure 2, after deleting key 22, then key 25 and key 73 are siblings. (D) In Figure 2, after deleting key 66, then key 35 is red. (E) In Figure 2, after deleting key 83, then key 89 is red.

複選題44.Consider an AA tree that results from suc ccessively inserting keys 96, 49, 79, 14, 41, 87, 75, 90, 61 into an initially empty tree. Which of the following statements are true? (A) The root is key 61. (B) There is less than 3 horizontal links. (C) Key 41 and key 49 are in the same level. (D) Key 87 and key 96 are siblings. (E) Key 14 is the parent of key 4 1.

複選題45. Consider a min-heap. Which of the following statements are true? (A) For any subtrec of a min-heap, the root of the subtree contains the smallest key occurring anywhere in that subtree. (B) An array that is in ascending order is a binary min-heap. (C) The scqucnce [1.5.6,7.14,17.10.23 13.12] is a binary min-heap. (D) The largest key must reside in a leaf. (E) The smallest key must reside in a leaf

複選題46. Consider a Fibonacci heap that results from successively inseting 929 (distinct) keys into an initially empty heap. followed by deleting the minin imum key. Which of the following statements are true? (A) The Fibonacci heap is of degree 9. (B) The Fibonacci heap is of height 12. (C) There are 5 trees in the Fibonacci heap. (D) With one additional decrease key operation, the Fibonacci heap can have 6 trees. (E) With two additiunal dourcase key uperations, the Fibonacct heap can have 7 trees.

複選題47. Which of the following are desirable properties of a hash function h(x)?(A) If x1,...,xn are the items to be hashed. then the numbers h(x1),..., h(xn) should be uniformly distributed over the (B) The range of h(x) should incinde a wide r range of integers. (C) The range of h(x) should stay within the desired hash-table sizc. (D) It should be computable in O( 1) time. (E) It should take distinct values over all possible items to be hashed. integers.

1. 下列何者為目前一般常用矽晶太陽光電模組之封裝結構順序？(A)玻璃/EVA/太陽電池電路/EVA/Tedlar(B)玻璃/EVA/太陽電池電路/EVA/玻璃(C)玻璃/太陽電池電路/EVA/Tedlar(D)玻璃/EVA/太陽電池電路/Tedlar。

2. 當併聯型變流器併接至具有供應多分路能力之配電設備時，供電電路之匯流排或導線之過電流保護裝置額定安培容量總和，不得超過該匯流排或導線額定多少倍？(A)1.2 倍(B)1.5 倍(C)1 倍(D)1.56倍。

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

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

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

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