CPU Scheduling Questions & Answers

Operating System Questions & Answers – CPU Scheduling

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

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

Explanation: None.
2. 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

Explanation: None.
3. 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

Explanation: None.
4. 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

Explanation: None.
5. 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

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

6. 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

Explanation: None.
7. 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

Explanation: None.
8. 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

Explanation: None.
9. 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

Explanation: None.
10. 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

Explanation: None.

CPU Scheduling is the process of determining which process will have exclusive use of the CPU while another is paused. The basic goal of CPU scheduling is to ensure that whenever the CPU is idle, the OS chooses at least one of the programmes in the ready queue to run. It’s also referred to as a CPU scheduler. Its primary goal is to improve system performance in accordance with the set of criteria established. It is the transition from the process’s ready to running stage. The CPU scheduler chooses a process from among those that are ready to run and allocates CPU to that process.

Leave a Reply

Your email address will not be published. Required fields are marked *