週三"阿摩用功日",VIP 免費領取 前往領取
馨小妞>試卷(2022/01/14)

中山◆資工◆作業系統與資料結構題庫 下載題庫

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

選擇:0題,非選:27題 我要補題 回報試卷錯誤
【非選題】
1.
1.[Process Management:

【題組】 (1) Explain the two basic models of inter-process communication.


【非選題】
2.【題組】(2) When will a race condition occur?

【非選題】
3.【題組】(3) What are the three requirements that a critical-section solution should meet?

【非選題】
4.【題組】(4) What is the difference between deadlock prevention and deadlock avoidance?

【非選題】
5.【題組】(5) When will priority inversion occur in process synchronization?

【非選題】
6.
2.Memory Management:

【題組】 (1) What device deals with address translation? In which case we will not use this device?


【非選題】
7.【題組】(2) Please give two benefits of using paging.

【非選題】
8.【題組】(3) Does any system use the optimal page replacement method? Why or why not?

【非選題】
9.【題組】(4) Let average page-fault time and memory-access time be 70us and 250ns, respectively. What is the expected page-fault rate if we want to get effective access time smaller than 285ns? List your calculation.

【非選題】
10.【題組】(5) What is reentrant code? 

【非選題】
11.
3.[Storage and I/0 Management:

【題組】 (1) When a file is opened, what are the four items of file information kept in UNIX?


【非選題】
12.【題組】(2) Consider a disk queue with requests for I/O to blocks on cylinders 100, 185, 40, 120, 2, 138, 75 and 87. Let the disk head currently stay at cylinder 60, and the maximum cylinder be 200. Please give the results of SSTF and C-LOOK scheduling methods.

【非選題】
13.【題組】(3) How does the parity bit work in RAID?

【非選題】
14.【題組】(4) Give three methods for CPU to know whether data are ready in an I/O device.

【非選題】
15.
4.[Protection and Security:

【題組】 (1) What is the principle of least privilege? How does Sun Microsystems OS implement it?


【非選題】
16.【題組】(2) Why language-based protection may not be secure?

【非選題】
17.【題組】(3) How do polymorphic and tunneling viruses bypass the detection of antivirus software?

【非選題】
18.【題組】(4) How does the digital-signature algorithm work?

【非選題】
19.【題組】(5) How does DDoS work?

【非選題】
20.
5.Basic Data Structures:

【題組】(1) Consider a binary tree. Suppose that its DFS result is "c, b, e, f, d, h, i, g, k, a, j" while BFS result is "c, b, g, e, d, k, j, f, h, i, a". Please draw the tree.


【非選題】
21.【題組】(2) Given the postfix of an equation "2 4 + 6 x 98 - 3 5 + x -", please compute its result. List your calculation.

【非選題】
22.【題組】(3) What is a binary search tree? Explain its property.

【非選題】
23.【題組】(4) Except that every node is either red or black, how can you make a binary search tree become a red-black tree?

【非選題】
24.【題組】(5) Show that the worst-case complexity of quicksort is O(끄?).

【非選題】
25.
6. [Advanced Data Structures:

【題組】(1) Given an n-key B-tree with minimum degree t, what is the upper bound of tree height? Prove the correctness of your answer.


【非選題】
26.【題組】(2) What is a B*-tree?

【非選題】
27.【題組】(3) Given a binomial tree Bt, show that there are exactly C(k, 1) nodes at depth i, where C(k, ) denotes a combination function.

懸賞詳解

國三地球科學下第一次

2.臺灣夏季雨量最主要來自何者? (A)鋒面雨 (B)午後雷雨 (C)颱風 (D)對流雨。 ...

50 x

前往解題

107 年 - 107 國立中山大學_碩士班招生考試_資工系(甲組):作業系統與資料結構#105786-阿摩線上測驗

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