Multiple Choice
I/O-bound program typically has many short ______ and a CPU-bound program might have a few long __________.
A) I/O burst, CPU burst
B) I/O burst, I/O burst
C) CPU burst, CPU burst
D) CPU burst, I/O burst
Correct Answer:

Verified
Correct Answer:
Verified
Q3: In Solaris, what is the time quantum
Q4: Shortest-remaining-time-first scheduling is the preemptive version of
Q5: The most complex scheduling algorithm is the
Q6: Solaris and Windows assign higher-priority threads/tasks longer
Q7: Assume process P<sub>0</sub> and P<sub>1</sub> are the
Q9: Which of the following system architectures involves
Q10: Windows 7 User-mode scheduling (UMS) allows applications
Q11: Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS)
Q12: Explain the difference between response time and
Q13: In hard real-time systems, interrupt latency must