Operating System Multiple Choice Questions – CPU Scheduling

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “CPU Scheduling”.

1. 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
View Answer

Answer: a
Explanation: None.

2. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____________
a) job queue
b) ready queue
c) execution queue
d) process queue
View Answer

Answer: b
Explanation: None.

3. The interval from the time of submission of a process to the time of completion is termed as ____________
a) waiting time
b) turnaround time
c) response time
d) throughput
View Answer

Answer: b
Explanation: None.
advertisement
advertisement

4. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned
View Answer

Answer: a
Explanation: None.

5. In priority scheduling algorithm ____________
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) Equal priority processes can not be scheduled
d) None of the mentioned
View Answer

Answer: a
Explanation: None.

6. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
a) all process
b) currently running process
c) parent process
d) init process
View Answer

Answer: b
Explanation: None.

7. Which algorithm is defined in Time quantum?
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
View Answer

Answer: b
Explanation: None.
advertisement

8. Process are classified into different groups in ____________
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
View Answer

Answer: d
Explanation: None.

9. In multilevel feedback scheduling algorithm ____________
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned
View Answer

Answer: a
Explanation: None.
advertisement

10. Which one of the following can not be scheduled by the kernel?
a) kernel level thread
b) user level thread
c) process
d) none of the mentioned
View Answer

Answer: b
Explanation: User level threads are managed by thread library and the kernel is unaware of them.

More MCQs on CPU Scheduling:

Sanfoundry Global Education & Learning Series – Operating System.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.