阿摩線上測驗 登入

試題詳解

試卷:110年 - 110學士後_醫學系︰計算機概論與程式設計#100246 | 科目:研究所、轉學考(插大)、學士後-計算機概論

試卷資訊

試卷名稱:110年 - 110學士後_醫學系︰計算機概論與程式設計#100246

年份:110年

科目:研究所、轉學考(插大)、學士後-計算機概論

5. CPU scheduler selects the next process for execution. There are several basic scheduling methods, such as first-in-first-out (FIFO), shortest job first (SJF), and round-robin (RR). Regarding to these methods, which of the following comments is INCORRECT?
(A) With FIFO, the waiting time of a process may depend on the arriving order of the processes.
(B) Starvation won’t occur with FIFO.
(C) Theoretically, SJF is an optimal scheduling algorithm in terms of average waiting time.
(D) Starvation won’t occur with SJF.
(E) RR is a preemptive scheduling algorithm.
正確答案:登入後查看

詳解 (共 1 筆)

推薦的詳解#5038278
未解鎖
SJF定義為CPU以行程(process...
(共 94 字,隱藏中)
前往觀看
1
0