Multiple Choice
Complex scheduling algorithms
A) are very appropriate for very large computers
B) use minimal resources
C) use many resources
D) all of the mentioned
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
Q22: Which of the following algorithms tends to
Q24: Scheduling is done so as to_<br>A)increase cpu