Non Preemptive SJF or SJN CPU Scheduling Algorithm

[@trolladmin]

Ok

[@akumbar1685]

Priority what happened

[@Myknowledgebox]

Sir tell book name ?

[@ashwingupta8218]

Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds) , and priority (0 is the highest priority) shown below.
Process
Arrival time
Burst Time
Priority
P1
0
11
2
P2
5
28
0
P3
12
2
3
P4
2
10
1
P5
9
16
4
Calculate the turnaround time, waiting time, average waiting time, average turnaround time and average response time using FCFS, preemptive Priority scheduling and preemptive SJF algorithms

[@alekhyapoosapati]

can you please tell us the text book name?

[@mahiboobjilani7303]

Thanks alot sir

[@kalyangupta12]

Sir which book?

[@techpoint8293]

Pls tell the text book name

[@funnyoneforyou9169]

Okay