Welcome to the CPU Scheduling MCQs Page

Dive deep into the fascinating world of CPU Scheduling with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of CPU Scheduling, a crucial aspect of Operating System. In this section, you will encounter a diverse range of MCQs that cover various aspects of CPU Scheduling, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Operating System.


Check out the MCQs below to embark on an enriching journey through CPU Scheduling. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Operating System.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of CPU Scheduling. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

CPU Scheduling MCQs | Page 1 of 14

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.
Answer: (b).8.2 milliseconds
A major problem with priority scheduling is _________.
Answer: (b).Starvation
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 ___________.
Answer: (c).Polling and Interrupt
An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.
Answer: (c).Shorest job - first scheduling algorithm
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 __________.
Answer: (b).Aging
CPU performance is measured through ________.
Answer: (a).Throughput
Answer: (a).Using very large time slice degenerates in to first come first served algorithm
Answer: (d).All of the above
_________ does the job of allocating a process to the processor.
Answer: (d).Dispatcher
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 ________.
Answer: (c).Round Robin Scheduling
Page 1 of 14

Suggested Topics

Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!