資訊推薦

• 1. 國造全自動T91戰鬥步槍選擇射擊功能時，變換紐箭矢指向槍口是為?(A)單發(B)三連發(C)全自動(D)保險。
• 【題組】(2) When will a race condition occur?
• 【題組】(3) What are the three requirements that a critical-section solution should meet?
• 【題組】(4) What is the difference between deadlock prevention and deadlock avoidance?
• 【題組】(5) When will priority inversion occur in process synchronization?
• 2.Memory Management: 【題組】(1) What device deals with address translation? In which case we will not u
• 【題組】(2) Please give two benefits of using paging.
• 【題組】(3) Does any system use the optimal page replacement method? Why or why not?
• 【題組】(4) Let average page-fault time and memory-access time be 70us and 250ns, respectively. What is
• 【題組】(5) What is reentrant code?
• 3.[Storage and I/0 Management:【題組】(1) When a file is opened, what are the four items of file informa
• 【題組】(2) Consider a disk queue with requests for I/O to blocks on cylinders 100, 185, 40, 120, 2, 138
• 【題組】(3) How does the parity bit work in RAID?
• 【題組】(4) Give three methods for CPU to know whether data are ready in an I/O device.
• 4.[Protection and Security:【題組】(1) What is the principle of least privilege? How does Sun Microsyste
• 【題組】(2) Why language-based protection may not be secure?
• 【題組】(3) How do polymorphic and tunneling viruses bypass the detection of antivirus software?
• 【題組】(5) How does DDoS work?
• 5.Basic Data Structures:【題組】(1) Consider a binary tree. Suppose that its DFS result is "c, b, e
• 【題組】(2) Given the postfix of an equation "2 4 + 6 x 98 - 3 5 + x -", please compute its re
• 【題組】(3) What is a binary search tree? Explain its property.
• 【題組】(4) Except that every node is either red or black, how can you make a binary search tree become
• 【題組】(5) Show that the worst-case complexity of quicksort is O(끄?).
• 6. [Advanced Data Structures:【題組】(1) Given an n-key B-tree with minimum degree t, what is the upper
• 【題組】(2) What is a B*-tree?