1004664.
Given info
Process Arrival Time Burst Time Priority
P1 0 15 1
P2 3 2 5
P3 4 6 2
P4 8 2 3
P5 12 10 4
Q1.
First Come First Serve:
Here in this process our priority is arrival time, as the name suggests first priority is given to the process that arrived first.
Process1 Process2 Process3 Process4 Process5
T=0 15 17 23 25 35
Shortest Job First:
Here in this process our priority is time remaining for the completion of project, i.e. Burst Time. (non-preemptive)
Process1 Process2 Process4 Process3 Process5
T=0 15 17 19 25 35
Nonpreemptive Priority:
Here in this process we consider priority numbers assigned for the processes. (lowest priority number implies higher priority).
Process1 …show more content…
Given quantum = 4.
P1(5 to 15) P2(over) P3(5 to 6) P4(over) P5(5 to 10) P3(over) P5(9 to 10) P1(13 to 15) P5(over) P1(over)
0 4 6 10 12 16 20 22 26 30 32 35
Q2. Turnaround time for each process in each algorithm?
Turnaround time = (process completion time – Arrival