阿摩線上測驗
登入
首頁
>
中山◆資工◆作業系統與資料結構
>
109年 - 109 國立中山大學_碩士班招生考試_資工系(甲組)：作業系統與資料結構#105756
>
8. Show the Hufinan tree created from the following nodes arranged in a priority queue.
其他申論題
(c) LOOK
#450084
(d) C-SCAN
#450085
(e) C-LOOK
#450086
7. Given the following weighted graph, show the order in which the edges are added to the minimnum cost spanning tree using Kruskal's algorithm. (Use weight to represent edges in your answer and just show the order.)
#450087
9. For any input of size n and assuming that ki denotes the maximum number of digits and Iz the number of buckets, what is the average-case running time of each of the following sorting algorithms: (a) selection sort, (b) merge sort, (c) heap sort, (d) radix sort, and (e) bucket sort?
#450089
10. The Ackermann function A(m, n) is defined recursively for non-negative integers m and n as follows:Its value grows very quickly, even for small values of m and n. For instance, A(4. 1) = 65533. What wouldbe the values of A(3.2) and A(2, 4)?
#450090
14. 一個滑板是由 1 個踏板、1 個輪架及 2 組相同品牌的滑輪組合而成，如圖。 某滑板店提供 3 種不同品牌的踏板、1 種輪架及 2 種不同品牌的滑輪，讓顧客自由選擇搭配，每一種零件的單價如下表： 今欲隨意組裝一個不超過 3000 元的滑板 ，則有 ______ 種不同的搭配方式。
#450091
(1)a = ______
#450092
(2) b = ______
#450093
(3) c = ______
#450094
阿摩線上測驗
登入
阿摩線上測驗
登入