阿摩線上測驗 登入

105年 - 105 國立中山大學_碩士班招生考試_資工系(甲組)：作業系統與資料結構#105820

科目：中山◆資工◆作業系統與資料結構 | 年份：105年 | 選擇題數：0 | 申論題數：29

試卷資訊

所屬科目：中山◆資工◆作業系統與資料結構

選擇題 (0)

申論題 (29)

(1) What is the priority inversion problem? How can we solve this problem?
(2) Please explain how a deadlock avoidance scheme works?
(3) Please give three necessary conditions for any solution to the critical-section problem.
(1) What is a mount point?
(2) What is the advantage of multilevel naming?
(3) What are the two parts of the random-access time for a magnetic disk?
(4) Please explain the two interrupt request lines for a CPU?
(1) Please explain the three common solutions to the dynamic storage allocation problem in memory.
(2) What are the purposes of MMU and TLB?
(3) Show that a stack algorithm will never encounter the Belady's anomaly.
(4) How does the Buddy system work to allocate kernel memory?
(1) Please give three methods to implement a protection domain and explain when domain switching will occur in each method.
(2) Please list the advantages of using language-based protection.
(3) What is the difference between a computer virus and a computer worm?
(4) In asymmetric encryption, how do you realize key distribution?
(5) What is the difference between signature-based and anomaly detection?
(1) Supposing that we store n keys in a hash table with size of n' by a universal hash function, prove that the collision probability is less than 0.5.
(2) Given a binomial heap below, please show the result of extracting the node with minimum key.
(1) What is the major property of a binary search tree?
(2) Given a set of numbers 8, 2, 7, 9, 14, 16, 3, 1, 4, and 10, draw the heap used by the heapsort method.
(3) Prove that the best-case complexity of the quicksort method is O(n 1gn).
(1) What are the two major properties of a tree?
(2) Prove that any red-black tree with k internal nodes can have a height no more than 21g(k+1).
(3) Explain three variants of a B-tree: B+-tree, B*-trce, and 2-3-4 tree.
(1) Starting from node E, give the sequence by bread-Tirst-search. If you have multiple choices, just follow the alphabetical order.
(2) Starting from node D, give the scquence by depth-first-scarch. If you have multiple choices, just follow the alphabetical order.
(3) Show the result by the Kruskal's algorithmn.
(4) Starting from node I, show the result by the Prim's algorithmn.
(5) Show the minimum connected dominating set.