103年 - 103 淡江大學 轉學考 資料結構#53188

科目：研究所、轉學考(插大)-資料結構 | 年份：103年 | 選擇題數：0 | 申論題數：10

試卷資訊

所屬科目：研究所、轉學考(插大)-資料結構

選擇題 (0)

申論題 (10)

【已刪除】Notice : Please make your answers as clear and readable as possible 1. The intermediate results of a sorting process are shown below. Please indicate which sorting method is used and explain why. (20%)
(a) Please explain sequential search and binary search.
(b) Please discuss their time complexities. (20%)
(a) Give two properties of a good hashing function.
(b) Give a good hashing function.
(c) Define linear probing.
(d) Define chaining. (20%)
(a) Nine integers are inserted into an empty max heap in the following order. Please draw the final max heap. The properties of the max heap must be kept after each integer is inserted. 50, 43,38,82, 94, 16, 25,45, 56
(b) With the following declaration, please give the algorithm for inserting an integer (a node) into a max heap. You may define and use the necessary parameters. int heap [MAX—SIZE]; /* MAX—SIZE is the maximum heap size */ (20%)
5. The order of the nodes visited in a binary tree T using preorder traversal is F, A, H，I，B, L，J，E, D，G, K, C, M. If inorder traversal is used, it is H, I，A, L，B，J, F, D, G, E, K, M, C. Please draw the binary tree T. (20%)