Multiple Choice
Which of the following algorithms tends to minimize the process flow time?
A) first come first served
B) shortest job first
C) earliest deadline first
D) longest job first
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q14: Scheduling is done so as to<br>A)increase the
Q15: In the following cases non - preemptive
Q16: An I/O bound program will typically have<br>A)a
Q17: Scheduling is done so as to<br>A)increase the
Q18: The portion of the process scheduler in
Q19: What is Scheduling?<br>A)allowing a job to use
Q20: There are 10 different processes running on
Q21: What is Turnaround time?<br>A)the total waiting time
Q23: Complex scheduling algorithms<br>A)are very appropriate for very
Q24: Scheduling is done so as to_<br>A)increase cpu