Round robin scheduling falls under the category of ___________
A. Non-preemptive scheduling
B. Preemptive scheduling
C. All of the mentioned
D. None of the mentioned
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
微信支付 
支付宝支付