Q. A major problem with priority scheduling is _________.

View solution

Q. The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register's busy bit becomes clear. This is called _____________ and a mechanism for the hardware controller to notify the CPU that it is ready is called ___________.

View solution

Q. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.

View solution

Q. In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of Starvation of low priority processes may never execute, is resolved by __________.

View solution

Q. CPU performance is measured through ________.

View solution

Q. With the round robin CPU scheduling in a time-shared system ________.

View solution

Q. Which of the following is a criterion to evaluate a scheduling algorithm?

View solution

Q. _________ does the job of allocating a process to the processor.

View solution

Q. In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.

View solution

Q. In the multi-programming environment, the main memory consisting of _________ number of process.

View solution

Q. CPU Scheduling is the basis of _________ operating system.

View solution

Q. ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.

View solution

Q. Saving the state of the old process and loading the saved state of the new process is called ________.

View solution

Q. Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given with their priorities in the order: Process : Burst Time : Priority respectively . P1 : 10 : 3 , P2 : 1 : 1 , P3 : 2 : 4 , P4 : 1 : 5 , P5 : 5 : 2.

View solution

Q. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________.

View solution

Q. The degree of Multiprogramming is controlled by

View solution

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