Multiple Choice
No movement between queues is a very simple policy that rewards those who have ____ jobs.
A) high-priority
B) low-priority
C) CPU-bound
D) I/O-bound
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q1: The transition from _ is initiated by
Q2: Some systems use a strategy known as
Q3: A(n)_ is created by a process,and it
Q4: The first-come,first-served (FCFS)algorithm is fine for most
Q6: The transition from _ can be initiated
Q7: Assume that four jobs,A-D,are in the READY
Q8: A job's state moves from HOLD to
Q9: If one job monopolizes the system,the extent
Q10: _ requires that the processor be allocated
Q11: _ is a dynamic-priority preemptive scheduling algorithm