阿摩線上測驗 登入

申論題資訊

試卷:109年 - 109 國立中山大學_碩士班招生考試_資工系(甲組):作業系統與資料結構#105756
科目:中山◆資工◆作業系統與資料結構
年份:109年
排序:0

題組內容

INSTRUCTIONS: If any question is unclear or you believe some assumptions need to be made, state your assumptions clearly at the beginning of your answer.
1. Consider the following set of processes, with the length of the CPU-burst timne given in milliseconds:
Burst Time Priority Process
61dfba6196a94.jpg
The processes are assumed to have arrived in the order P1. P2, P3, P4, P5, all at time 0.

申論題內容

(a) What is the completion time of process Pi using a nonpreemptive priority (a smaller priority number implies a higher priority) scheduling?