Question

WHAT IS EXPLANSION FOR SJF?

Answer 1

Shortest-Job-First (SJF) is a non-preemptive discipline in which waiting job (or process) with the smallest estimated run-time-to-completion is run next. In other words, when CPU is available, it is assigned to the process that has smallest next CPU burst.

Answer 2

Shortest Job First (SJF) is an optimal scheduling algorithm as it gives maximum Throughput and minimum average waiting time(WT) and turn around time (TAT) but it is not practically implementable because Burst-Time of a process can't be predicted in advance.

HOPE IT HELPS

PLEASE MARK ME BRAINLIEST ☺️