[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
Explanation: all the processes will be able to get completed.

1.9k

0

Do you find this helpful?

2

View all MCQs in

Software Project Management (SPM)

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?
Ensuring that no more than the allocated number of people are allocated at any given time in Software Scheduling is known as
Which of the following is a project scheduling method that can be applied to software development?
What is Scheduling?
A semaphore is a shared integer variable
The reputation for cloud computing services for the quality of those services is shared by
According to the time estimates made by the PERT planners, the maximum time that would be needed to complete an activity is called as
The difference between the maximum time available and the actual time needed to perform an activity is known as
What is FIFO algorithm?