Aurora’s Scientific, Technological and Research Academy, Hyderabad

Department of Computer Science and Engineering

Operating Systems – Assignment - I
1. Consider the following process details
Process Arrival Time Burst Time Priority (1- Highest priority)
A 1 5 1
B 0 3 2
C 2 8 4
D 3 6 3

a. Draw gannt chart and calculate average waiting time and turnaround time using
1. FCFS 2. SJF (preemptive and Non-preemptive) 3. Priority (Preemptive and Non-
preemptive) 4. Round robin (TQ=2 ms)
2. Consider the following process details
Process Arrival Time Burst Time
1 0 9
2 1 4
3 2 9

a. Draw gannt chart and calculate average waiting time and turnaround time using
1. FCFS 2. SJF (Non-preemptive) 3. Priority (Non-preemptive) 4. Round robin
(TQ=2 ms)

3. Assume the following processes that arrive for execution at the time indicated and also
mention with the length of the CPU burst time given in ms.
Process Burst Time Arrival Time priority (1 – highest priority)
P1 9 0 2
P2 6 0 3
P3 3 0 4
P4 4 0 5
P5 2 4 1
P6 1 6 5

1) Give a Gantt chart illustrating the execution of these processes using FCFS, RR
(quantum=2), SRTF and SJF, Priority scheduling.
2) Calculate the average TAT and AWT for the above scheduling algorithms.
4. Assume the following work load in a system. All jobs arrive at time 0.

Job Burst time priority

A 8 2
B 4 1
C 5 4
D 2 2
E 1 3

a) Draw a gantt chart to execute these jobs using FCFS, RR (quantum=4ms), non
preemptive priority and SJF scheduling.
b) Calculate the average waiting time and average TAT for each above scheduling
algorithms.