阿摩線上測驗
登入
首頁
>
台大◆電機◆計算機結構與作業系統(A)
>
109年 - 109國立臺灣大學_碩士班招生考試_電機工程研究所丙組:計算機結構與作業系統(A)#105855
> 申論題
題組內容
6. (5 points) Continuing from the last question, please answer which of the following statements is/are correct!
(a) RAID 3 uses byte-level striping with a dedicated parity disk.
相關申論題
(b) RAID 4 consists of bit-level striping with a dedicated parity disk.
#451203
(c) RAID 5 consists of bit-level striping with distributed parity.
#451204
(a) If the process is allocated 4 frames, the LRU algorithm incurs 10 page faults.
#451205
(b) If the process is allocated 6 frames, the optimal algorithm incurs 8 page faults.
#451206
(c) If the process is allocated 5 frames, the FIFO algorithm incurs 13 page faults.
#451207
(a) If the process is allocated 4 frames, the reference-bit algorithm incurs 15 page faults. Assume that we start searching from the frame next to the frame with the last brought in page. If the page last brought in is in the last frame, then we start searching from the first frame.
#451208
(b) If the process is allocated 5 frames, the -chance algorithm incurs 14 page faults. Assume that we start searching from the frame next to the fame with the last brought in page. If the page last brought in is in the last frame, then we start searching from the first frame.
#451209
(c) If the process is allocated 6 frames, the LFU counting algorithm incurs 10 page faults. Assume that we start searching from the frame next to the frame with the last brought in page. If the page last brought in is in the last frame, then we start searching from the first frame.
#451210
(a) Root is the first process created in system booting.
#451211
(b) Daemon is a program running as a background process.
#451212
相關試卷
110年 - 110 國立臺灣大學_碩士班招生考試_電機工程研究所丙組:計算機結構與作業系統(A)#102089
110年 · #102089
109年 - 109國立臺灣大學_碩士班招生考試_電機工程研究所丙組:計算機結構與作業系統(A)#105855
109年 · #105855