With round robin scheduling algorithm in a time shared system ____________
A. using very large time slices converts it into First come First served scheduling algorithm
B. using very small time slices converts it into First come First served scheduling algorithm
C. using extremely small time slices increases performance
D. using very small time slices converts it into Shortest Job First algorithm
查看答案
Complex scheduling algorithms ____________
A. are very appropriate for very large computers
B. use minimal resources
C. use many resources
D. all of the mentioned
The strategy of making processes that are logically runnable to be temporarily suspended is called ____________
A. Non preemptive scheduling
B. Preemptive scheduling
C. Shortest job first
D. First come First served
What is Scheduling?
A. allowing a job to use the processor
B. making proper use of processor
C. all of the mentioned
D. none of the mentioned
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
微信支付 
支付宝支付