Computer Science - Operating Systems course

2. (a) Given the following information: Job Arrival time CPU cycle A B blo 0 2 4 5 11 6 3 1 10 9 4 D E F 13 Draw the timeline for each of the process scheduling algorithms showing the time that each job arrives and the order that each is processed Calculate the turnaround time for each job. (1) First Come First Serve (15/100) (ii) Shortest Job First (15/100) (iii) Shortest Remaining Time (15/100) (iv) Round Robin ( using a time quantum of 3, ignore context switching)