阿摩線上測驗登入

首頁 > 研究所、轉學考(插大)◆ 離散數學與資料結構 > 110年 - 110 國立高雄大學_碩士班招生考試_資訊工程學系：離散數學與資料結構#102139 > 申論題

3. (10%) For the B-tree below, show the new B-tree that would result from inserting 21.

相關申論題

(a) (10%) Use Heapsort to sort the array and show the array a[ ] after the complete max heap is constructed (i.e., after phase 1 of Heapsort is done).

(b) (5%) What is the time complexity of Heapsort?

5. (5%) Consider the five keys on the left side of the figure below. Also as shown in the figure, a hash function is applied to these five keys where two keys are hashed to the same integer. Discuss how to solve this collision.

(a) (20%) Discuss how to find the intersection nodes of the two lists (the intersection nodes refer to the nodes appear in both of the two lists), and what is the corresponding time complexity.

(b) (15%) If the nodes in the lists are not lexicographically ordered, discuss how to find the intersection nodes of the two lists, and what is the corresponding time complexity.

7. (5%) Write the code segment that inserts into a circular doubly linked list the node to which x points before the node to which y points.

(a) DNA polymeraseα/ primase(3分)

(b) proofreading exonuclease(3分)

(c) uracil DNA glycosylase(3分)

(d) RNase H(3分)

相關試卷

110年 - 110 國立臺灣科技大學_碩士班招生試題_工業工程系：統計學#111373

110年 · #111373

110年 - 110 國立高雄大學_碩士班招生考試_資訊工程學系：離散數學與資料結構#102139

110年 · #102139

阿摩線上測驗

提供最完整的考試資料庫，包含歷年試題、詳解、申論題等學習資源，
幫助學生有效準備各類考試。

最新資料

© 2008-2026 Yamol Tech Ltd. All Rights Reserved.
阿摩線上測驗--最強大的互動線上測驗版權所有

如有任何問題或建議，歡迎聯繫我們