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

Explore more Topics under Operating System

Q91.
‘Aging’ is :

a.

keeping track of cache contents

b.

keeping track of what pages are currently residing in memory

c.

keeping track of how many times a given page is referenced

d.

increasing the priority of jobs to ensure termination in a finite time

Discuss
Answer: (d).increasing the priority of jobs to ensure termination in a finite time
Q92.
A solution to the problem of indefinite blockage of low – priority processes is :

a.

Starvation

b.

Wait queue

c.

Ready queue

d.

Aging

Discuss
Answer: (d).Aging
Q93.
Which of the following statements are true ?
i) Shortest remaining time first scheduling may cause starvation
ii) Preemptive scheduling may cause starvation
iii) Round robin is better than FCFS in terns of response time

a.

i only

b.

i and iii only

c.

ii and iii only

d.

i, ii and iii

Discuss
Answer: (d).i, ii and iii
Q94.
Which of the following scheduling algorithms gives minimum average waiting time ?

a.

FCFS

b.

SJF

c.

Round – robin

d.

Priority

Discuss
Answer: (b).SJF
Q95.
Match the following:
List – I - - - - - - - - - - - - - - - - - - - - - - - - - List – II
a. Multilevel feedback queue - - - - - - - - - i. Time-slicing
b. FCFS - - - - - - - - - - - - - - - - - - - - - - - -ii. Criteria to move processes between queues
c. Shortest process next - - - - - - - - - - - -iii. Batch processing
d. Round robin scheduling - - - - - - - - - - -iv. Exponential smoothing

a.

a-i, b-iii, c-ii, d-iv

b.

a-iv, b-iii, c-ii, d-i

c.

a-iii, b-i, c-iv, d-i

d.

a-ii, b-iii, c-iv, d-i

Discuss
Answer: (d).a-ii, b-iii, c-iv, d-i
Q96.
How you will describe Throughput in operating system?

a.

Number of times a program produces output.

b.

Number of times the program is running.

c.

Number of programs processed by it per unit time

d.

None of the above.

Discuss
Answer: (c).Number of programs processed by it per unit time
Q97.
Which of the following scheduling policy is well suited for a time shared operating system?

a.

First come first serve.

b.

Shortest job first

c.

Round robin

d.

None of the above.

Discuss
Answer: (c).Round robin
Q98.
What is the most suitable scheduling policy for a time - shared operating systems?

a.

Shortest Job First

b.

Elevator

c.

First Come First Served

d.

Round Robin

Discuss
Answer: (d).Round Robin
Q99.
Consider a uniprocessor computer system that has 2 processes and both of them alternate 10ms CPU bursts with 90ms I / O bursts. Both the processes were created at nearly the same time and can proceed in parallel. What is the scheduling strategy for this system that will result in the least CPU utilization (over a long period of time) ?

a.

Round Robin scheduling with a time quantum of 5ms

b.

First Come First Served scheduling

c.

Shortest remaining time first

d.

Static priority scheduling with different priorities for the two processes

Discuss
Answer: (a).Round Robin scheduling with a time quantum of 5ms
Q100.
We have an operating system, which is capable of loading and executing a single sequential user process at a time. If the disk head scheduling algorithm which is initially First Come First Served (FCFS) is replaced by Shortest Seek Time First (SSTF) claimed by the vendor to give 50% better benchmark results then what is the expected improvement in the I / O performance of the user programs?

a.

0%

b.

25%

c.

50%

d.

75%

Discuss
Answer: (a).0%
Page 10 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!

Python

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

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...