problem: Let consider the given set of processes, with the length of CPU-burst time given in milliseconds:
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are supposed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
Q1. Sketch four Gantt charts describing the execution of these processes by using FCFS, SJF, and A non preemptive priority (a smaller priority number implies a higher priority) and RR (quantum = 1) scheduling.
Q2. Find out the turnaround time of each process for each of the scheduling algorithms in part (1)?
Q3. Describe the waiting time of each process for each of the scheduling algorithms in Part (1)?
Q4. prepare down the schedules in part (1) result in the minimal average waiting time (over all the processes)?