A. Assigning ready processes to cpu
B. Assigning ready processes to waiting queue
C. Assigning running processes to blocked queue
D. All of the mentioned

A. Non-preemptive scheduling
B. Preemptive scheduling
C. All of the mentioned
D. None of the mentioned

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

A. Are very appropriate for very large computers
B. Use minimal resources
C. Use many resources
D. All of the mentioned

A. First executes the job that came in last in the queue
B. First executes the job that came in first in the queue
C. First executes the job that needs minimal processor
D. First executes the job that has maximum processor needs

A. Non preemptive scheduling
B. Preemptive scheduling
C. Shortest job first
D. First come first served

A. Allowing a job to use the processor
B. Making proper use of processor
C. All of the mentioned
D. None of the mentioned

A. Tq = 15ms
B. Tq = 40ms
C. Tq = 45ms
D. Tq = 50ms

A. Earliest due date
B. Slack time remaining
C. First come, first served
D. Critical ratio

A. First come first served
B. Shortest job first
C. Earliest deadline first
D. Longest job first