Operating System!!!

Question 9

Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed.

Process	Arrival Time	Burst Time	Priority
P1	0	3	3
P2	1	2	4
P3	3	7	5
P4	6	5	1
P5	7	3	2

Part 1

By using SJF scheduling algorithm (preemptive):

Draw Gantt charts that illustrate the execution of these processes.

What is the average turnaround time for these processes?

What is the average waiting time for these processes?

What is the average response time for these processes?

Part 2

By using priority scheduling algorithm (preemptive):

Draw Gantt charts that illustrate the execution of these processes.

What is the average turnaround time for these processes?

What is the average waiting time for these processes?

What is the average response time for these processes?

Part 3

By using round-robin scheduling algorithm (quantum = 2):

Draw Gantt charts that illustrate the execution of these processes.

What is the average turnaround time for these processes?

What is the average waiting time for these processes?

What is the average response time for these processes?

Part 4

The waiting time of RR algorithm with quantum = 2 is high, if we choose time quantum = 5 rather than 2, examine how this change can affect waiting and response time? Justify why these numbers change in that way.