COMPUTER SOFTWARE
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: -Shortest Job First – Preemptive Scheduling Algorithm is an algorithm in which the processor is allocated to the job having minimum CPU burst time, but the job can be preempted (Replaced) by a newer job with shorter burst time.
Detailed explanation-3: -Shortest-job-first and priority scheduling may suffer from starvation which can be prevented by a technique called aging because In the shortest job first and priority scheduling, the processer allocates the CPU with low Burst time and high priority process respectively so starvation occurred.
Detailed explanation-4: -Shortest Job First (SJF) is a type of disk scheduling algorithm in the operating system in which the processor executes the job first that has the smallest execution time. In the shortest Job First algorithm, the processes are scheduled according to the burst time of these processes.