This queue keeps all the processes in the system.

• Ready queue

• Job queue

• Device queue

This queue keeps a set of all processes residing in main memory, ready and waiting to execute. A new process is always put in this queue.

• Ready queue

• Job queue

• Device queue

In this category of scheduling, the resource can’t be taken from a process until the process completes execution.

• Preemptive

• Non-preemptive

What are the two states in the two-state process model?

• running

• ready

• terminated

• not running

____ are special system software which handle process scheduling in various ways. Their main task is to select the jobs to be submitted into the system and to decide which process to run.

It is the mechanism to store and restore the state or context of a CPU in Process Control block so that a process execution can be resumed from the same point at a later time.

• swapping

• context switching

• spooling

• process scheduling

Short-term schedulers, also known as dispatchers, make the decision of which process to execute next. Short-term schedulers are faster than long-term schedulers.

• True

• False

It is also called as CPU scheduler. It selects a process among the processes that are ready to execute and allocates CPU to one of them.

• • Long-Term Scheduler

• • Short-Term Scheduler

• • Medium-Term Scheduler

This is a process scheduling algorithm where each process is assigned a priority. Process with highest priority is to be executed first and so on.

• Round Robin Scheduling

• Multiple-Level Queues Scheduling

• Priority Based Scheduling

• First Come First Serve

This is process scheduling algorithm makes use of other existing algorithms to group and schedule jobs with common characteristics. Each queue can have its own scheduling algorithms.

• Round Robin Scheduling

• Multiple-Level Queues Scheduling

• Priority Based Scheduling

• First Come First Serve