1. | 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. |
Discuss |
Answer: (b).8.2 milliseconds
|
2. | A major problem with priority scheduling is _________. |
Discuss |
Answer: (b).Starvation
|
3. | 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 ___________. |
Discuss |
Answer: (c).Polling and Interrupt
|
4. | An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________. |
Discuss |
Answer: (c).Shorest job - first scheduling algorithm
|
5. | 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 __________. |
Discuss |
Answer: (b).Aging
|
6. | CPU performance is measured through ________. |
Discuss |
Answer: (a).Throughput
|
7. | With the round robin CPU scheduling in a time-shared system ________. |
Discuss |
Answer: (a).Using very large time slice degenerates in to first come first served algorithm
|
8. | Which of the following is a criterion to evaluate a scheduling algorithm? |
Discuss |
Answer: (d).All of the above
|
9. | _________ does the job of allocating a process to the processor. |
Discuss |
Answer: (d).Dispatcher
|
10. | 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 ________. |
Discuss |
Answer: (c).Round Robin Scheduling
|