This dispatching mechanism performs non$-$preemptive, low$-$level scheduling is a fashion that gives preference to shorter $($execution time$)$ processes. The user supplies an estimated time of execution taken as the first CPU burst time.

Question $39$ options:

Round Robin

Shortest Remaining Job First $($SRJF$)$

FIFO

Shortest Job First $($SJF$)$