Question

. Explain briefly a) Round Robin scheduling b) SJF scheduling​

Answer 1

Answer:

Hope it will help u ❣️

Explanation:

Round-robin is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices are assigned to each process in equal portions and in circular order, handling all processes without priority.

Shortest job next, also known as shortest job first or shortest process next, is a scheduling policy that selects for execution the waiting process with the smallest execution time. SJN is a non-preemptive algorithm. Shortest remaining time is a preemptive variant of SJN.

Answer 2

What is meant by round robin scheduling algorithm?

Round Robin is a CPU scheduling algorithm where each process is assigned a fixed time slot in a cyclic way. One of the most commonly used technique in CPU scheduling as a core. It is preemptive as processes are assigned CPU only for a fixed slice of time at most.

Shortest Job First (SJF)

is an algorithm in which the process having the smallest execution time is chosen for the next execution. This scheduling method can be preemptive or non-preemptive. It significantly reduces the average waiting time for other processes awaiting execution.