following jobs/processes, job lengths, and arrival times, compute the completion time, turnaround time, and waiting time for each job in a table. Draw the Gantt chart and suggest an application for each job. (Consider 5 as a highest priority and 0 as a lowest priority). a. First Come First Serve (FCFS) b. Shortest Job First Scheduling (SJF) algorithm. c. Shortest Remaining time (SRT) algorithm. BN104 Operating System 4 Prepared by: Archana Banepali Moderated by: Dr Rajan Kadel T1, 2023 Question 4 d. Non-preemptive priority scheduling algorithm e. Pre-emptive priority Scheduling algorithm f. Round-Robin Scheduling algorithm (consider time slice is 4ms). Process Burst Time Arr
Given the following jobs/processes, job lengths, and arrival times, compute the completion time,
turnaround time, and waiting time for each job in a table. Draw the Gantt chart and suggest an
application for each job. (Consider 5 as a highest priority and 0 as a lowest priority).
a. First Come First Serve (FCFS)
b. Shortest Job First Scheduling (SJF)
c. Shortest Remaining time (SRT) algorithm.
BN104
Prepared by: Archana Banepali Moderated by: Dr Rajan Kadel T1, 2023
Question 4
d. Non-preemptive priority scheduling algorithm
e. Pre-emptive priority Scheduling algorithm
f. Round-Robin Scheduling algorithm (consider time slice is 4ms).
Process Burst Time Arrival
Time
Priority
P1 11 2 3
P2 28 1 1
P3 2 3 4
P4 10 4 2
P5 16 5 5
Table: Processes with Arrival Time, Burst Time and Priority
Step by step
Solved in 3 steps
