資訊推薦

• 2.(Menory Maiageneut: ]【題組】(1) What are the purposes of base and limit registers?
• 【題組】(2) Give the six steps to handle a page-fault event.
• 【題組】(3) Let average page-fault time and memory-access time be 80us and 240ns, respectively. What is
• 【題組】(4) Suppose that it takes 35ns and 105ns to search TLB and access memory, respectively. If TLB h
• 3. [Storage and I/O Management: ]【題組】(1) What are the two functions supported by a VFS (virtual file
• 【題組】(2) Consider a disk queue with requests for I/O to blocks on cylinders 103, 188, 42, 120, 7, 138
• 【題組】(3) Explain seek time, rotational latency, and random-access time for disks.
• 【題組】(4) Explain the two major types of memory-mapped I/O.
• 4. [Synchronization and Deadlock: ]【題組】(1) Explain how the deadlock prevention scheme works.
• 【題組】(2) Give three requirements for any solution to the critical-section problem.
• 【題組】(3) What is the priority inversion problem? How to solve it?
• 【題組】(4) What is conflict serializable for a non-serial schedule?
• 5. [Security: ]【題組】(1) How to launch an attack of stack and buffer overflow?
• 【題組】(2) Explain the two major types of symmetric encryption.
• 【題組】(3) Explain how the RSA algorithm works.
• 【題組】(4) How does the digital-signature algorithm work?
• 【題組】(5) What is an interrupt war caused by tunneling viruses?
• 8. 已知 a、b 為正整數且 a 與 b 的乘積是11位數，而 化成小數後的整數部分是 2 位數，則 a 可能為幾位數？(A) 5 位數 (B) 6 位數 (C) 7 位數 (D) 8 位數 (E)
• 1.小柯時常有便祕的狀況，醫生建議他多食用含有纖維素的食物。請問下列哪一種食物含有大量的纖維素？ (A)乳酪(B)瘦肉 (C)蔬菜 (D)米飯。
• 【題組】1.3 What is the maximum magnitude of ordinary numbers (i.e, excluding intinity, NaN, andsubnorma
• 4. 設f(x)為首項係數為正的二次函數，且通過 (1,0), (2,0) 兩點。若 y =f(x)的圖形右移 1 單位，形成另一個函數 y=g(x)的圖形，則f(x)+g(x) ≥0 的解為何？(A
• 【題組】(d) (5 %) If Si substrate is biased under 10 V. Please calculate the △VT.
• 1.下列哪一文句用字完全正確？ (A) 這場傳染病漫延的速度真是超乎我們所預期的快 (B)從營火蟲的有無可以推知自然環境是否受到汙染 (C)許多人在結冰的湖面上享受著溜冰的樂趣(D)植物的籐蔓長得細長
• 【題組】(2)What is simpl le uniforn rm hash shing? Given a a hash table with m slots that stores n eleme
• 【題組】(3) Except that every node is either red or black, how do you make a binary search tree become a