COMPUTER SCIENCE AND ENGINEERING
SYSTEM SOFTWARE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Shortest job first
|
|
|
First come first served
|
|
|
Shortest remaining time
|
|
|
High priority job
|
Detailed explanation-1: -Preemptive shortest job first Preemptive means that if another process arrives with an even shorter burst time after the process with the shortest burst time and arrival time is given CPU time, the CPU cycle is allocated to the process with the shorter burst time.
Detailed explanation-2: -A pre-emptive SJF algorithm will preempt the currently executing process, whereas a nonpreemptive SJF algorithm will allow the currently running process to finish its CPU burst. Nonpreemptive SJF scheduling would result in an average waiting time of 7.75 milliseconds.
Detailed explanation-3: -Characteristics of SJF Scheduling It can improve process throughput by making sure that shorter jobs are executed first, hence possibly have a short turnaround time. It improves job output by offering shorter jobs, which should be executed first, which mostly have a shorter turnaround time.
Detailed explanation-4: -Solutions for Which of the following is FALSE about SJF (Shortest Job First Scheduling)? S1: It causes minimum average waiting timeS2: It can cause starvationa)Only S1b)Only S2c)Both S1 and S2d)Neither S1 nor S2Correct answer is option ‘D’.