Question: Implement the shortest job first scheduling algorithms that will do that 1. Take as input processes and their respective CPU burst and return the average:
1. Take as input processes and their respective CPU burst and return the average: waiting time, turnaround time and normalized turnaround times of the processes. Note that this implementation does not consider the arrival times of processes 2. Take as input processes and their respective CPU burst together with their arrival times and return the average: waiting time, turnaround time and normalized turnaround times of the processes. Note that this implementation does not consider the arrival times of processes You can implement in any programming language of your choice but be ready to modify it after implementation in class
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
