☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
作業系統
›
Ch4 行程與執行緒管理
第 34 題／共 70 題
◀
OS 34/70
錯題回報
00:00
34. SJF、FIFO、Round Robin、MLFQ
#OS-04-034
中
SJF
FIFO
Round Robin
MLFQ
📝
☆
Which of following statement(s) about CPU scheduling are correct?
A
(a) The turnaround time of the non-preemptive Shortest-Job-First (SJF) scheduling remains even when the arrival rate of jobs varies.
B
(b) The turnaround time of the SJF is always shorter than that of the First-In-First-Out (FIFO) scheduling when all jobs arrive in the system simultaneously.
C
(c) We define the response time as the time from when the job arrives in a system to the first time it is scheduled for execution. The average response time of the round robin (RR) scheduling is shorter than that of preemptive SJF scheduling.
D
(d) We can periodically increase the priority of all jobs in the system to mitigate the starvation problem exhibited in Multi-Level Feedback Queue (MLFQ) scheduling.
📝 寫筆記
📄 交大115
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 作業系統》Ch4 行程與執行緒管理
‹
本章題號 · 21–40 / 70
›
全部 70
易 41
中 24
難 5
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
