阿摩線上測驗
登入
首頁
>
中山◆資工◆作業系統
>
110年 - 110 國立中山大學_碩士班招生考試_資工系(資安)：作業系統#104266
> 申論題
題組內容
2.Memory:[ 20%]
(1) How do the first-fit, best-fit, and worst-fit methods work for memory allocation? (6%)
相關申論題
(1) Except for the process state, what are the six components in a process control block? (6%)
#441312
(2) Please define interrupt latency and dispatch latency. (4%)
#441313
(3) As compared with processes, will or will not context switching among multiple threads incur less overhead? Why or why not? (4%)
#441314
(4) According to POSIX threads, what are the three procedures involved in a mutex and how to use them? (6%)
#441315
(2) Why can virtual memory speed up process creation? (4%)
#441317
(3) When using demand paging, what problem will occur in an inverted page table? How to solve that problem? (4%)
#441318
(4) In case of a page fault, what are the six steps for the operating system to handle it? (6%)
#441319
(1) What are the four major pieces of information associated with an open file? (4%)
#441320
(2) Explain the six common types of access for a file. (6%)
#441321
(3) What is the difference between physical and logical formatting of a disk? (4%)
#441322
相關試卷
110年 - 110 國立中山大學_碩士班招生考試_資工系(資安)：作業系統#104266
110年 · #104266
109年 - 109 國立中山大學_碩士班招生考試_資工系(資安)：作業系統#105760
109年 · #105760
108年 - 108 國立中山大學_碩士班招生考試_資工系(資安)：作業系統#105763
108年 · #105763
阿摩線上測驗
登入
阿摩線上測驗
登入