ProGrads 卷別
計算機結構與作業系統
選擇國立臺灣大學 2026 · 考試 · 第 5 題
考科作業系統
Regarding scheduling and neglecting context-switching time, given a set of processes, select correct description(s).
（複選；至少一個正確選項，每個選項獨立計分。）
- (A)If the processes arrive at the same time, the optimal nonpreemptive scheduling for minimizing average waiting time is the Shortest-Job-First (SJF) scheduling.
- (B)If the processes arrive at different times, the optimal nonpreemptive scheduling for minimizing average waiting time is the Shortest-Job-First (SJF) scheduling.
- (C)If the processes arrive at different times, the optimal preemptive scheduling for minimizing average waiting time is the Shortest-Remaining-Time-First (SRTF) scheduling.
- (D)If the processes have deadlines and arrive at different times, the optimal nonpreemptive scheduling for schedulability is the Earliest-Deadline-First (EDF) scheduling.
- (E)If the processes have deadlines and arrive at different times, the optimal preemptive scheduling for schedulability is the Earliest-Deadline-First (EDF) scheduling.