Complex scheduling algorithms ____________

are very appropriate for very large computers

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

assigning ready processes to waiting queue

assigning ready processes to CPU

assigning ready processes to waiting queue

assigning running processes to blocked queue

With round robin scheduling algorithm in a time shared system ____________

using very small time slices converts it into First come First served scheduling algorithm

using very large time slices converts it into First come First served scheduling algorithm

using very small time slices converts it into First come First served scheduling algorithm

using extremely small time slices increases performance

using very small time slices converts it into Shortest Job First algorithm

Explore topic-wise MCQs in Operating System.

This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.

1.	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
Answer» B. tQ = 40ms

Discussion

2.	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
Answer» C. Shortest job first

Discussion

3.	Complex scheduling algorithms ____________
A.	are very appropriate for very large computers
B.	use minimal resources
C.	use many resources
D.	all of the mentioned
Answer» B. use minimal resources

Discussion

4.	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
Answer» B. assigning ready processes to waiting queue

Discussion

5.	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
Answer» B. using very small time slices converts it into First come First served scheduling algorithm

Discussion

6.	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
Answer» C. All of the mentioned

Discussion

Explore topic-wise MCQs in Operating System.

The strategy of making processes that are logically runnable to be temporarily suspended is called ____________

Complex scheduling algorithms ____________

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

With round robin scheduling algorithm in a time shared system ____________

Round robin scheduling falls under the category of ____________