adplus-dvertising

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.

frame-decoration

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

Explore more Topics under Operating System

Q1.
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.

a.

8 milliseconds

b.

8.2 milliseconds

c.

7.75 milliseconds

d.

3 milliseconds

Discuss
Answer: (b).8.2 milliseconds
Q2.
A major problem with priority scheduling is _________.

a.

Definite blocking

b.

Starvation

c.

Low priority

d.

None of the above

Discuss
Answer: (b).Starvation
Q3.
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 ___________.

a.

Interrupt and Polling

b.

Polling and Spooling

c.

Polling and Interrupt

d.

Deadlock and Starvation

Discuss
Answer: (c).Polling and Interrupt
Q4.
An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.

a.

FCFS scheduling algorithm

b.

Round robin scheduling algorithm

c.

Shorest job - first scheduling algorithm

d.

None of the above

Discuss
Answer: (c).Shorest job - first scheduling algorithm
Q5.
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 __________.

a.

Terminating the process

b.

Aging

c.

Mutual Exclusion

d.

Semaphore

Discuss
Answer: (b).Aging
Q6.
CPU performance is measured through ________.

a.

Throughput

b.

MHz

c.

Flaps

d.

None of the above

Discuss
Answer: (a).Throughput
Q7.
With the round robin CPU scheduling in a time-shared system ________.

a.

Using very large time slice degenerates in to first come first served algorithm

b.

Using extremely small time slices improve performance

c.

Using extremely small time slices degenerate in to last in first out algorithm

d.

Using medium sized time slices leads to shortest request time first algorithm

Discuss
Answer: (a).Using very large time slice degenerates in to first come first served algorithm
Q8.
Which of the following is a criterion to evaluate a scheduling algorithm?

a.

CPU Utilization: Keep CPU utilization as high as possible

b.

Throughput: number of processes completed per unit time

c.

Waiting Time: Amount of time spent ready to run but not running

d.

All of the above

Discuss
Answer: (d).All of the above
Q9.
_________ does the job of allocating a process to the processor.

a.

Long term scheduler

b.

Short term scheduler

c.

Medium term scheduler

d.

Dispatcher

Discuss
Answer: (d).Dispatcher
Q10.
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 ________.

a.

Shortest Remaining Time Next (SRTN) Scheduling

b.

Priority Based Preemptive Scheduling

c.

Round Robin Scheduling

d.

None of the above

Discuss
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!

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

Compiler Design

Unravel the process of translating source code into executable programs with our...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...