Multiple Choice
An I/O bound program will typically have
A) a few very short cpu bursts
B) many very short i/o bursts
C) many very short cpu bursts
D) a few very short i/o bursts
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q11: Which is the most optimal scheduling algorithm?<br>A)fcfs
Q12: Scheduling is done so as to<br>A)increase the
Q13: With round robin scheduling algorithm in a
Q14: Scheduling is done so as to<br>A)increase the
Q15: In the following cases non - preemptive
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