Reference no: EM13164487

Compute the turnaround time for 4 batchh jobs, A through D, which arrived on a computer at almost the same time( say ,at time 0)

Process                                            A        B       C     D

position in queue(1st is fornt)          1         2        3     4

run times (estimated)                      100    50       10    20

priorites(10 is max, 0 is min)           2         10       6      1

Compute average turnaround time( assuming no process switiching overhead) for the following scheduling algorithms, assuming all jobs are CPU-bound and do almost no I/O.

a) Round robin, assuming multiprogramming with preemption

b)Priority Scheduling, one job at a time, runs until it finishes.

c) First come first served, one job at a time, runs until it finishes.

d) Shortest Job First, one job at a time, runs until it finishes.