7. 07: Assume the following Process. Process Burst Time Priority P1 20 3 P2 5 1 P3 3 5 P4 7 4 P5 9 2 Arrival Time 0 5 10 6 35 For the set of processes directly above, draw a Gantt chart for the Priority Scheduling Algorithm using. CS=0 a) What is the Priority Scheduling Algorithm? b) Is the Priority Scheduling Algorithm preemptive or non-preemptive? c) What is a major problem with the Priority Scheduling Algorithm? d) What is the solution to starvation with the Priority Scheduling Algorithm? e) For the set of processes directly above, calculate the throughput for the Priority Scheduling Algorithm using non-preemption. f) For the set of processes directly above, calculate the turnaround time for the Priority Scheduling Algorithm using non-preemption. g) For the set of processes directly above, calculate the average turnaround time for the Priority Scheduling Algorithm using non-preemption. h) For the set of processes directly above, calculate the waiting time for the Priority Scheduling Algorithm using non-preemption. i) For the set of processes directly above, calculate the average waiting time for the Priority Scheduling Algorithm using non-preemption. j) What is the CPU Utilization for the system? 8. Q 8: Repeat Q7 with CS=1 9. 09: Assume the following Process. Process Burst Time Priority Arrival Time P1 16 3 0 P2 3 1 5 P3 5 5 8 P4 6 4 4 P5 11 2 6 For the set of processes directly above, draw a Gantt chart for the Round Robin Scheduling Algorithm using. CS=0 a) For the set of processes directly above, draw a Gantt chart for the the Round Robin Algorithm for a time quantum of = 5 ms. b) For the set of processes directly above, calculate the throughput for the Round Robin Algorithm for a time quantum of 5 ms. c) For the set of processes directly above, calculate the turnaround time for the Round Robin Algorithm for a time quantum of 5 ms. d) For the set of processes directly above, calculate the average turnaround time for the Round Robin Algorithm for a time quantum of 5 ms. e) For the set of processes directly above, calculate the waiting time for the Round Robin Algorithm for a time quantum of 5 ms. 1) For the set of processes directly above, calculate the average wailing time for the Round Robin Algorithm for a time quantum of 5 ms. g) What will happen if the time quantum for the Round Robin Algorithm is too small? h) What will happen if the time quantum for the Round Robin Algorithm is too large? i) What is the CPU Utilization for the system? 10. 10: Repeat 09 with CS=1
