An example of a non-pre-emptive scheduling algorithm is
2008
An example of a non-pre-emptive scheduling algorithm is
- A.
Round Robin
- B.
Priority Scheduling
- C.
Shortest job first
- D.
2 level scheduling
Attempted by 258 students.
Show answer & explanation
Correct answer: C
Shortest Job First is a standard non-pre-emptive scheduling algorithm where the process with the shortest burst time executes first without interruption. Round Robin is strictly pre-emptive due to time quantum expiration, while Priority Scheduling can operate in both modes.
A video solution is available for this question — log in and enroll to watch it.