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 5 of 14

Explore more Topics under Operating System

Q41.
Which scheduling policy is most suitable for time shared operating system ?

a.

Shortest job first

b.

FCFS

c.

LCFS

d.

Round robin

Discuss
Answer: (d).Round robin
Q42.
Belady anomaly occurs in ?

a.

LIFO

b.

FIFO

c.

LRU

d.

NRU

Discuss
Answer: (b).FIFO
Q43.
Which among following scheduling algorithms give minimum average waiting time

a.

FCFS

b.

SJF

c.

Round robin

d.

On priority

Discuss
Answer: (b).SJF
Q44.
In which scheduling policies, context switching never takes place

a.

FCFS

b.

round robin

c.

Shortest job first

d.

Pre-empitive

Discuss
Answer: (a).FCFS
Q45.
Dispatcher function is to

a.

put tasks in I/O wait

b.

schedule tasks in processor

c.

change task priorities

d.

All of above

Discuss
Answer: (a).put tasks in I/O wait
Q46.
Shortest Job First executes first the job

a.

with the least processor needs

b.

that first entered the queue

c.

that has been in the queue for the longest

d.

that last entered the queue

Discuss
Answer: (a).with the least processor needs
Q47.
Creating a job queue is a function of

a.

Spooler

b.

Interperator

c.

Complier

d.

Drive

Discuss
Answer: (a).Spooler
Q48.
Poor response times are caused by

a.

Busy processor

b.

High I/O rate

c.

High paging rates

d.

Any of above

Discuss
Answer: (d).Any of above
Q49.
Which is non pre-emptive

a.

Round robin

b.

FIFO

c.

MQS

d.

MQSF

Discuss
Answer: (b).FIFO
Q50.
Which module gives control of the CPU to the process selected by the short-term scheduler?

a.

dispatcher

b.

interrupt

c.

scheduler

d.

none of the mentioned

Discuss
Answer: (a).dispatcher
Page 5 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!

DBMS

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

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Software Engineering

Learn about the systematic approach to developing software with our Software...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Wireless and Mobile Communications

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

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...