Question

Example of sjf non preemptive scheduling

Answer 1

Set 1 (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.