Question: What is SJF CPU Sechduling Algorithm?

Answer: In Shortest job first(SJF) algorithm,It is a type of CPU scheduling. This algorithm associate with each process the length of the latter’s next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst time. It is a scheduling policy that selects for executing the waiting process with the smallest execution time. If two processes have the same length next CPU burst, First Come will be executed.

Example: we have three processes P₁, P₂, P₃ their burst time are 3, 4, 7, 8