[Solved] With round robin scheduling algorithm in a time shared system

McqMate

Q.	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» A. using very large time slices converts it into first come first served scheduling algorithm

980

0

Do you find this helpful?

6

View all MCQs in

Operating System (OS)

Discussion

No comments yet

Related MCQs

Round robin scheduling falls under the category of
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?
In priority scheduling algorithm
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
Which is the most optimal scheduling algorithm?
Which of the following scheduling algorithms gives minimum average waiting time?
An SJF algorithm is simply a priority algorithm where the priority is
CPU scheduling is the basis of
In the following cases non – preemptive scheduling occurs?
Scheduling is done so as to