CPU Scheduling Benefits - Operating System Questions and Answers

  • 1. CPU scheduling is the basis of ___________
   A.) multiprocessor systems
   B.) multiprogramming operating systems
   C.) larger memory sized systems
   D.) none of these

Answer: Option 'B'

multiprogramming operating systems

  • 2. Response time is :
   A.) the total time taken from the submission time till the completion time
   B.) the total time taken from the submission time till the first response is produced
   C.) the total time taken from submission time till the response is output
   D.) none of these

Answer: Option 'B'

the total time taken from the submission time till the first response is produced

  • 3. Scheduling is done so as to :
   A.) increase the waiting time
   B.) keep the waiting time the same
   C.) decrease the waiting time
   D.) none of these

Answer: Option 'C'

decrease the waiting time

  • 4. Waiting time is :
   A.) the total time in the blocked and waiting queues
   B.) the total time spent in the ready queue
   C.) the total time spent in the running queue
   D.) the total time from the completion till the submission of a process

Answer: Option 'B'

the total time spent in the ready queue

  • 5. With multiprogramming, ______ is used productively.
   A.) time
   B.) space
   C.) money
   D.) all of these

Answer: Option 'A'

time

  • 6. The two steps of a process execution are :
   A.) OS & Memory Burst
   B.) CPU & I/O Burst
   C.) I/O & OS Burst
   D.) Memory & I/O Burst

Answer: Option 'B'

CPU & I/O Burst

  • 7. An I/O bound program will typically have :
   A.) a few very short CPU bursts
   B.) many very short I/O bursts
   C.) many very short CPU bursts
   D.) a few very short I/O bursts

Answer: Option 'C'

many very short CPU bursts

  • 8. A process is selected from the ______ queue by the ________ scheduler, to be executed.
   A.) ready, long term
   B.) ready, short term
   C.) blocked, short term
   D.) wait, long term

Answer: Option 'B'

ready, short term

  • 9. In the following cases non – preemptive scheduling occurs :
   A.) When a process switches from the running state to the ready state
   B.) When a process goes from the running state to the waiting state
   C.) When a process switches from the waiting state to the ready state
   D.) All of these

Answer: Option 'B'

When a process goes from the running state to the waiting state

  • 10. Scheduling is done so as to :
   A.) increase the turnaround time
   B.) decrease the turnaround time
   C.) keep the turnaround time same
   D.) there is no relation between scheduling and turnaround time

Answer: Option 'B'

decrease the turnaround time

  • 11. Turnaround time is :
   A.) the total waiting time for a process to finish execution
   B.) the total time spent in the ready queue
   C.) the total time spent in the running queue
   D.) the total time from the completion till the submission of a process

Answer: Option 'D'

the total time from the completion till the submission of a process

  • 12. The switching of the CPU from one process or thread to another is called :
   A.) process switch
   B.) task switch
   C.) context switch
   D.) all of these

Answer: Option 'D'

all of these

  • 13. Dispatch latency is :
   A.) the speed of dispatching a process from running to the ready state
   B.) the time of dispatching a process from running to ready state and keeping the CPU idle
   C.) the time to stop one process and start running another one
   D.) none of these

Answer: Option 'C'

the time to stop one process and start running another one

  • 14. Scheduling is done so as to :
   A.) increase CPU utilization
   B.) decrease CPU utilization
   C.) keep the CPU more idle
   D.) None of these

Answer: Option 'A'

increase CPU utilization

  • 15. Scheduling is done so as to :
   A.) increase the throughput
   B.) decrease the throughput
   C.) increase the duration of a specific amount of work
   D.) None of these

Answer: Option 'A'

increase the throughput



CPU Scheduling Benefits - Operating System Questions and Answers Download Pdf