[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.

1k

0

Do you find this helpful?

7

View all MCQs in

Information Retrival Techniques

Discussion

No comments yet

Related MCQs

Round robin scheduling falls under the category of
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?
Complex scheduling algorithms
What is Scheduling?
What is the time complexity of evaluation of postfix expression algorithm?
A search algorithm takes as an input and returns as an output.
What is FIFO algorithm?
identification algorithm which scores collocations using log-likelihood ratio.
Which of the following term is best defined by the statement “In a distributed system, several processes may operate at the same time on separate computers on the network.”?
What combines the outward manifestation of the computer-based system , coupled with all supporting information that describe system syntax and semantics?