Q7 : Assume the Following Process. Process Burst Time Priority Arrival Time
P1 20 3 0
P2 5 1 5
P3 3 5 10
P4 7 4 6
P5 9 2 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?
Q 8: Repeat Q7 with CS=1