# Recent questions tagged sjf

1
For the given question instead of the given order if we take one unit of P2 as its arrival time is 1 and then schedule P1 next we get the same answer,even in the hint they have given as the process which comes first should get first priority instead in ... first.My approach and the solution given ends up giving the same answer,does this happen for all cases or just happening for this question?
2
Let's say we have four processes as (P1, P2, P3, P4) and have Arrival time as (0,1,2,3) respectively, but all of them has same CPU Burst time as (10ms) then does SRTF will simply be behaving like FCFS?
3
4
Let's say we have two CPU scheduling algorithm as SJF and SRTF and we have a arbitrary pool/set of processes with different ARRIVAL TIME and CPU BURST, then what CPU scheduling algorithm will result in minimum average waiting time? Note : We know, with processes ... for only this set of values or when arrival times are different than SRTF will ALWAYS have the less average waiting time over SJF?
5
Facts about SJF Algorithm: Maximum Throughput Minimum Average TAT Maximum Response Time Maximum CPU Utilization
Calculate the Exponential averaging for the $\text{SJF}$ with $T_{1}=10,\alpha = 0.5$ and previous runs as $8,7,4,16$ $\text{(Give the answer correct to one decimal place).}$