CPS 3250 Homework 1 1. Assume that you have the following jobs to execute with one processor Job Burst Time Priority 1 10 3 2 1 1 3 2 3 4 1 4 5 5 2 Figure out the turnaround time and the waiting time for each job in each situation below a) The jobs arrived in the order 1, 2, 3, 4, 5 and are scheduled on a first come first served basis b) The jobs are scheduled using Round Robin with a quantum of 1 c) The jobs are scheduled using Shortest Job First d) The jobs are scheduled according to a non-preemptive priority algorithm 2. Assume a system with a memory that has 3 partitions of size 10K, 50K, and 40K OS 10K 50K 40K Memory If three jobs arrive with memory requirements of 8K, 32K, and 20K how much fragmentation would there be if: a) A First Fit Algorithm is used. b) A Best Fit Algorithm is used c) A Worst Fit Algorithm is used