阿摩線上測驗
登入
首頁
>
中山◆資工◆作業系統與資料結構
>
108年 - 108 國立中山大學_碩士班招生考試_資工系(甲組#105764
>
題組內容
2. [Advanced Data Structu ures: ]
(2) Using a B-tree to maintain disk blocks helps reduce the cost of disk access. Why?
其他申論題
(3) Except that every node is either red or black, how do you make a binary search tree become a red- black tree?
#450218
(4) Given n objects to be sorted, show the average-case r running time of the following algorithms: Heap sort, insertion sot, bubble sort, and quick sort.
#450219
(5) Given the adjacency matrix of an undirected graph:Show the sequence of nodes that you visit by using breadth-first search and depth-first scarch. Ifthere are multiple choices to select nodes, just follow the alphabetical order.
#450220
(1) Given a directed graph G = (V, E), what is its strongly connected component?
#450221
(3) What is the difference between a B*-tree and a B*-tree?
#450223
(4) What are the two properties of a binomial-beap?
#450224
(5) Consider a Fibonacci heap as follows:
#450225
(1) What is a race condition? How to solve it?
#450226
(2) What is the difference between deadlock prevention and deadlock avoidance?
#450227
(3) When will you need to use a condition variable?
#450228
阿摩線上測驗
登入
阿摩線上測驗
登入