題組內容

1.Let us consider a set of processes as follows, where they have arrived in the order of P1, P2, P3, P4, and P5 all at time 0:

(a) Please draw four Gantt charts to show the execution of all processes based on the following scheduling algorithms: First-come first-served (FCFS), round robin (RR with quantum = 1), shortest job first (SJF), and non-preemptive priority (where a smaller priority number indicates a higher priority).