阿摩線上測驗
登入
首頁
>
中山◆資工◆作業系統
>
108年 - 108 國立中山大學_碩士班招生考試_資工系(資安)：作業系統#105763
>
題組內容
4. [Synchronization and Deadlock: ]
(2) Give three requirements for any solution to the critical-section problem.
其他申論題
(2) Consider a disk queue with requests for I/O to blocks on cylinders 103, 188, 42, 120, 7, 138, 76 and 87. Let the disk head currently stay at cylinder 65, and the maximum cylinder be 200. Show the results of SSTF and C-LOOK scheduling methods.
#450204
(3) Explain seek time, rotational latency, and random-access time for disks.
#450205
(4) Explain the two major types of memory-mapped I/O.
#450206
(1) Explain how the deadlock prevention scheme works.
#450207
(3) What is the priority inversion problem? How to solve it?
#450209
(4) What is conflict serializable for a non-serial schedule?
#450210
(1) How to launch an attack of stack and buffer overflow?
#450211
(2) Explain the two major types of symmetric encryption.
#450212
(3) Explain how the RSA algorithm works.
#450213
(4) How does the digital-signature algorithm work?
#450214
阿摩線上測驗
登入
阿摩線上測驗
登入