ns: Process F G H J K Arrival Time 2 3 11 17 24 Bust Time 4 3 5 6. 12 1. Apply the following scheduling algorithms to the list of processes above. First-Come First-Serve Process E F G J K Arrival Time...

Extracted text: ns: Process F G H J K Arrival Time 2 3 11 17 24 Bust Time 4 3 5 6. 12 1. Apply the following scheduling algorithms to the list of processes above. First-Come First-Serve Process E F G J K Arrival Time 3 5 11 17 24 Bust Time 4 9 3 7 12 Finish Time 4 13 16 23 28 34 46 Turnaround 4 11 13 18 17 17 22 Time Waiting Time 2 10 11 12 11 10 H. J K 13 16 23 28 34 46 Average turnaround time: 102 / 7 = 14.57 Average waiting time: 56 /7 = 8 Shortest Remaining Time First Process E H. K Arrival Time 2 3 5 11 17 24 Bust Time 4 9. 3 7 5 6. 12 Finish Time 4 34 7 14 19 25 46 Turnaround 32 4 9 8 9 22 Time Waiting Time 23 1 2 3 2 10 E G H J | F K 2 4 7 11 14 17 19 25 34 46


Extracted text: Round Robin: Quantum = 3 Process F G H J K Arrival Time 3 11 17 24 Bust Time 4 9 3 7 6 12 Finish Time 7 19 13 22 28 34 46 Turnaround 7 17 10 17 17 17 12 Time Waiting Time 3 10 10 10 12 11 E G H. H J K 3 6. 7 10 13 16 19 22 25 26 28 34 46 Average turnaround time: 97/7= 13.86 Average waiting time: 56/7 = 8 2. Then, answer the following items a. Among the three (3) process scheduling algorithms that you have performed, which do you think is the most efficient and why? I think the most efficient scheduling algorithm is the First Come First Serve for the operating system since it has the least b. Cite significant differences in the results of applying the First Come First-Serve algorithm and Round Robin algorithm. Elaborate on your answer. C What could possibly happen if the value of the Quantum in Round Robin is increased to 5? Elaborate on your answer. d. In your opinion, why does the average turnaround time and waiting time vary per algorithm? e. Would you suggest the utilization of the Round Robin algorithm for process scheduling in a file management system? Why or why not?