If all processes I/O bound, the ready queue will almost always be              and the Short term Scheduler will have a              to do.

Related MCQs

• 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?
• The primary distinction between the short term scheduler and the long term scheduler is
• A process is selected from the               queue by the                  scheduler, to be executed.
• Which module gives control of the CPU to the process selected by the short-term scheduler?
• What is a short-term scheduler?                      
• The                  consists of all processes whose memory images are in the backing store or in memory and are ready to run.
• The portion of the process scheduler in an operating system that dispatches processes is concerned with                          
• What is a long-term scheduler?
• What is a medium-term scheduler?
• ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock