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?

Related MCQs

• With round robin scheduling algorithm in a time shared system                          
• If the number of cycles spent busy – waiting is not excessive, then                          
• Round robin scheduling falls under the category of                          
• In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the:
• If all processes I/O bound, the ready queue will almost always be              and the Short term Scheduler will have a              to do.
• Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
• Which algorithm is defined in Time quantum?
• Which of the following scheduling algorithms gives minimum average waiting time?
• What is Waiting time?
• The                    time in a swap out of a running process and swap in of a new process into the memory is very high.