Answer to Question #295960 in Algorithms for siri

Question

Five Processes P1, P2, P3, P4 and P5, arrive at almost the same time. They  have  estimated  running  times  of  M,  6,  2,  N,  and  8  respectively.  Their priorities are 3, 5, 2, 1, and 4, respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the average process turnaround time by ignoring process switching overhead. 
(a) Round-robin (with time quantum 2 unit) 
(b) Priority scheduling (using both preemptive and non-preemptive scheduling) 
(c) First come First serve (run in order mentioned above) 
(d) Shortest job first (using both preemptive and non-preemptive scheduling).

Answer 1

It's been a while since this question is posted here. Still, the answer hasn't been got. Consider converting this question to a fully qualified assignment, and we will try to assist. Please click the link below to proceed: Submit order