阿摩線上測驗
登入
首頁
>
中山◆資工◆作業系統與資料結構
>
108年 - 108 國立中山大學_碩士班招生考試_資工系(甲組#105764
>
題組內容
2. [Advanced Data Structu ures: ]
(5) Consider a Fibonacci heap as follows:
其他申論題
(1) Given a directed graph G = (V, E), what is its strongly connected component?
#450221
(2) Using a B-tree to maintain disk blocks helps reduce the cost of disk access. Why?
#450222
(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
(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
(4) What is the difference between asynchronous and deferred cancellation of a target thread?
#450229
(5) What are the four common conditions to cause process temination?
#450230
(1) Give two benefits of using paging.
#450231
阿摩線上測驗
登入
阿摩線上測驗
登入