Use the formula :

turnaround time per process = Completion time arrival time

waiting time = turnaround time burst time

Q1. Say we have the process arrival time chart given below.

Draw a Gantt chart to illustrate how these processes would be scheduled using Round Robin (RR) and First-come First-Served (FCS) scheduling, and calculate the waiting time for each process. If when choosing a process to schedule next you could legally choose any of a number of processes, choose the one with the lowest-numbered name; i.e., choose pi over pj if i < j. Do not include context-switching time in your chart. Assume that the quantum is set to 5 time units.

Q3. Given a process scheduling table as below:

Process	Arrival Time	CPU Burst Time
P1	0	6
B	1	3
C	2	4
D	2	2

What is the average turnaround time for these processes with the Shortest Remaining Time First scheduling algorithm? Also calculate the average waiting time.

Q4. Consider a system which has CPU bound process that requires a burst time of 40 units. Using he multilevel feedback queue scheduling, calculate the number of times the process will be interrupted if the time quantum on the first queue is 2 units and it increases by 5 units in other queues.

Q5. Clearly mark the algorithms listed below that could result in starvation. (explain why) You can assume that each process will use the CPU for a finite burst before performing I/O.

1. First-come, First-Served
2. Round Robin (aka preemptive FCFS)
3. Shortest Job First
4. Shortest Remaining Time First (aka preemptive SJF)
5. Priority
6. Priority-based Round Robin (aka preemptive Priority)
7. Multilevel Feedback Queue Scheduling