Q. Round robin scheduling is essentially the preemptive version of ________.

View solution

Q. In the blocked state

View solution

Q. The number of processes completed per unit time is known as __________.

View solution

Q. _________ is the situation in which a process is waiting on another process,which is also waiting on another process, which is waiting on the first process. None of the processes involved in this circular wait are making progress.

View solution

Q. FIFO scheduling is ________.

View solution

Q. The collection of processes on the disk that is waiting to be brought into memory for execution forms the ___________ .

View solution

Q. Which scheduler controls the degree of multi programming?

View solution

Q. A scheduling algorithm is fair

View solution

Q. What is a long-term scheduler ?

View solution

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

View solution

Q. What is a medium-term scheduler ?

View solution

Q. What is a short-term scheduler ?

View solution

Q. The primary distinction between the short term scheduler and the long term scheduler is :

View solution

Q. The only state transition that is initiated by the user process itself is :

View solution

Q. 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 :

View solution

Q. In a multi-programming environment :

View solution

Q. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the :

View solution

Q. The context of a process in the PCB of a process does not contain :

View solution

Q. Which of the following need not necessarily be saved on a context switch between processes ?

View solution

Q. Which of the following does not interrupt a running process ?

View solution