The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________

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

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

Explanation: All the processes will be able to get completed.

Complex scheduling algorithms ____________

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

Explanation: Large computers are overloaded with a greater number of processes.

What is FIFO algorithm?

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

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

Orders are processed in the sequence they arrive if _______ rule sequences the jobs.

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

Which of the following algorithms tends to minimize the process flow time?

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