APPLICATION SYSTEM SOFTWARE
SYSTEMS SOFTWARE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
First come, first served
|
|
|
Round robin
|
|
|
Shortest job first
|
|
|
Shortest remaining time
|
|
|
Multi-level feedback queues
|
Detailed explanation-1: -The full form of SRT is Shortest remaining time. It is also known as SJF preemptive scheduling. In this method, the process will be allocated to the task, which is closest to its completion.
Detailed explanation-2: -SJF is optimal-gives minimum average waiting time for a given set of processes.
Detailed explanation-3: -Priority scheduling: Priority is decided on the basis of memory requirements, time, and resources. Therefore Shortest job first scheduling (SJF) will result in the highest throughput.
Detailed explanation-4: -The incoming processes are short and there is no need for the processes to execute in a specific order. In this case, FCFS works best when compared to SJF and RR because the processes are short which means that no process will wait for a longer time.
Detailed explanation-5: -The FCFS is better for a small burst time. The SJF is better if the process comes to processor simultaneously. The last algorithm, Round Robin, is better to adjust the average waiting time desired.