Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 9, 2, 5, and 3 minutes. Their externally determined priorities are 3, 5, 2, 1, and 4 respectively, with 5 being the highest priority. For each of the following scheduling algorithm, determine the mean process turnaround time. Ignore process switching overhead time.

Round-Robin with quantum of 5

Priority Scheduling

First-Come, First Serve (run in order 10, 9, 2, 5, 3)

Shortest Job First