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

Explore more Topics under Operating System

Q101.
We have a uniprocessor machine where a set of n tasks with known run times r1, r2, r3,….rn are to be run. What will be the maximum throughput result of the processor scheduling algorithm?
Discuss
Answer: (a).Shortest Job First
Q102.
Three CPU intensive processes requires 10, 20 and 30 time units and arrive at times 0, 2 and 6 respectively. The operating system implements a shortest remaining time first scheduling algorithm. Considering that the context switches at time zero and at the end are not counted the number of context switches are needed is ______.

a.

4

b.

3

c.

2

d.

1

Discuss
Answer: (c).2
Discuss
Answer: (c).First - In - First - Out
Discuss
Answer: (d).All of the above statements are true
Q105.
On a single processor four jobs are to be executed. At time t = (0) + (jobs arrive in the order of A, B, C, D). The burst CPU time requirements are 4, 1, 8, 1 time units respectively.
Under Round Robin Scheduling with the time slice of 1 time unit the completion time of A is ______.

a.

3

b.

5

c.

7

d.

9

Discuss
Answer: (d).9
Q106.
Interval between the time of submission and completion of the job is called
Discuss
Answer: (b).Turnaround time
Q107.
A scheduler which selects processes from secondary storage device is called
Discuss
Answer: (c).Medium term scheduler
Q108.
The scheduling in which CPU is allocated to the process with least CPU-burst time is called
Discuss
Answer: (b).Shortest job first Scheduling
Discuss
Answer: (c).total time taken to execute the job.
Discuss
Answer: (a).forced de allocation of the CPU from a program which is executing on the CPU.

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!