阿摩線上測驗
登入
首頁
>
研究所、轉學考(插大)◆ 離散數學與資料結構
>
110年 - 110 國立高雄大學_碩士班招生考試_資訊工程學系：離散數學與資料結構#102139
> 申論題
題組內容
4. Assume array a[ ] contains seven numbers as shown below (a[0] is not used).
(b) (5%) What is the time complexity of Heapsort?
相關申論題
(a) at least one ball is selected for each color?
#429369
(b) no more than four balls are selected for each color?
#429370
(c) odd number of red balls, odd number of green balls, even number of white balls, and even number of black balls are selected?
#429371
(a) Describe each of the four properties: (i) reflexivity, (ii) symmetry, (iii) transitivity, and (iv) antisymmetry.
#429372
(b) Show that R is an equivalence relation.
#429373
(c) Describe the equivalence classes of the relation R.
#429374
3. (10%) For the B-tree below, show the new B-tree that would result from inserting 21.
#429375
(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).
#429376
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.
#429378
(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.
#429379
相關試卷
110年 - 110 國立臺灣科技大學_碩士班招生試題_工業工程系：統計學#111373
110年 · #111373
110年 - 110 國立高雄大學_碩士班招生考試_資訊工程學系：離散數學與資料結構#102139
110年 · #102139
阿摩線上測驗
登入
阿摩線上測驗
登入