SJF CPU Scheduling Algorithm in Hindi 🖥️

SJF(Shortest Job First)-Non- preemptive:
Shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next. SJN is a non-preemptive algorithm.
It may cause starvation if shorter processes keep coming. This problem can be solved using the concept of aging.

Completion Time: Time at which process completes its execution.
Turn Around Time: Time Difference between completion time and arrival time. Turn Around Time = Completion Time – Arrival Time
Waiting Time(W.T): Time Difference between turn around time and burst time.
Waiting Time = Turn Around Time – Burst Time

-------------------------------------------------------------------------------------------------------