(23) As the Hash Table in step (22), if keys 25 and 24 are searched, what is the total number of identifier comparisons?
(A)11
(B)13
(C)15
(D)17
(E) None of the above

(24) The records with keys :13, 14, 2, 11, 18, 3, 36, 28 , 21 are inserted in sequential order into Hash Table using chaining method instead for collision resolution. What is the total number of identifier comparisons if each key value is searched once. (A) 11 (B)13 (C)15 (D)17 (E) None of the above

(25) When a key value 37 is inserted into the BST, what is the 6th key value in the post-order traversal of the updated BST? (A)24 (B)37 (C) 30 )(D)26 (E) None of the above

(26) After step (25) is executed, the key value 48 is deleted from the BST, what is the 7th element in its pre-order traversal of the updated BST ? (A)26 (B)36 (C)22 (D) 37 (E) None of the above

(27) After step (26) is executed, the key value 26 is deleted from the BST, what is the fourth element in its post-order traversal of the updated BST? (A) 19 (B)20 (C)22 (D)24 (E) None of the above

(28) At the end of first pass of RadixSort, the 7th element of the resulting chain is (A)123 (B) 63 (C) 55 (D) 18 (E)None of the above

(29) At the end of 2nd pass of RadixSort, the 7th element of the resulting chain is (A)216 (B) 63 (C) 16 (D)123 (E)None of the above

(30) At the end of 3rd pass of RadixSort, the 7th element of the resulting chain is (A)216 (B)203 (C)210 (D) 123 (E)None of the above

(31) Consider the following algorithm. Algorithm Sort(A, n) Input: Array A containing n different integer values. Out: Array A sorted in increasing order of values. Which of the following instructions must be inserted at the point marked (*) so that the algorithm correctly sorts the values stored in A in increasing order of values? (A) for j ← 0 to n - 1 do if A[j] ＞ A[m] then m ← j (B) for j ← i+1 to n - 1 do if A[j] ＞ A[m] then m ← j (C) for j ← 0 to i - 1 do if A[j] ＞ A[m] then m ← j (D) for j← i+ 1 to n -1 do if A[j] ＜ A[m] then m ← j (E) for j ← O to n -1 do if A[j] ＜ A[m] then m ← j

(32) Assume that quicksort is being used to sort an array A with values 4 2 8 7 3 1 5 6. After the first invocation to the partition algorithm the array looks like this: 2 3 1 4 7 5 8 6 Which value could have been chosen as the pivot? (A)2 (B)3 (C)4 (D)7 (E)8

(33) Sorting 6 elements with a comparison sort requires at least how many comparisons in the worst case. (A) 6 (B) 7 (C)8 (D)9 (E)10

110年 - 110 國立臺灣科技大學_碩士班招生試題_電子工程系：資料結構#112844

110年 - 110 國立高雄科技大學_碩士班招生考試_電腦與通訊工程系：資料結構(乙組)#110488

110年 - 110 國立高雄科技大學_碩士班招生考試_資訊工程系：資料結構#110422

110年 - 110 國立中山大學_碩士暨碩士專班招生考試_資管系/乙組:資料結構#105545

110年 - 110台灣聯合大學系統_碩士班招生考試_電機類:資料結構#104954

110年 - 110 國立中央大學_碩士班招生考試_資訊管理暨大數據分析類:資料結構#103860

110年 - 110 國立政治大學_碩士班招生考試_資訊管理學系/科技組:資料結構#102881

110年 - 110 國立臺灣大學_碩士班招生考試_生物機電工程學研究所丙組:資料結構(C)#100901

110年 - 110 國立臺灣大學_碩士班招生考試_ 工程科學及海洋工程學研究所丁組:資料結構(A)#100759

109年 - 109 國立高雄大學_碩士班招生考試_資訊工程學系：資料結構#103082