Multiple Choice
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
A) tq = 15ms
B) tq = 40ms
C) tq = 45ms
D) tq = 50ms
Correct Answer:
Verified
Correct Answer:
Verified
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
Q21: What is Turnaround time?<br>A)the total waiting time
Q22: Which of the following algorithms tends to
Q23: Complex scheduling algorithms<br>A)are very appropriate for very
Q24: Scheduling is done so as to_<br>A)increase cpu