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

Q71.
Round robin scheduling falls under the category of :
Discuss
Answer: (b).Preemptive scheduling
Discuss
Answer: (a).using very large time slices converts it into First come First served scheduling algorithm
Q73.
The portion of the process scheduler in an operating system that dispatches processes is concerned with :
Discuss
Answer: (a).assigning ready processes to CPU
Discuss
Answer: (a).are very appropriate for very large computers
Discuss
Answer: (b).first executes the job that came in first in the queue
Q76.
The strategy of making processes that are logically runnable to be temporarily suspended is called :
Discuss
Answer: (b).Preemptive scheduling
Discuss
Answer: (c).Both a and b
Q78.
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin timesharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms ?
Discuss
Answer: (a).tQ = 15ms
Q79.
Which of the following algorithms tends to minimize the process flow time ?
Discuss
Answer: (b).Shortest Job First
Q80.
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 terms of response time
Discuss
Answer: (d).I, II and III

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!