COMP $5329-$ Advanced Operating Systems $($Spring $2024)$

Assignment $1-$ CPU Scheduling Algorithms

Due Date: February $18,2024$

Considering following list of processes, with their arrival times, burst times and priority as given

against each process.

Answer following questions:

First$-$Come, First$-$Served $($FCFS$)$ Scheduling:

a$.$ Calculate the turnaround time and waiting time for each process using the FCFS

algorithm.

b$.$ Compare the results of FCFS scheduling with Shortest Job First $($SJ$)$ scheduling for

above set of processes and calculate the average turnaround time for both algorithms.

Which algorithm performs better in this case, and why?

Round Robin Scheduling:

a$.$ Using Round Robin with a time quantum of $\text{'}2\text{'}$ units. Calculate the turnaround time for

each process and the average turnaround time for the entire set of processes.

b$.$ Discuss how the choice of the time quantum $\text{'}2\text{'}$ affects the performance of the Round

Robin scheduling algorithm. Calculate the turnaround times for different time quantum

values and $6$