Vaidikalaya

MCQ On CPU Scheduling

Q1. CPU scheduling is the basis of ___________.
  1. multiprocessor systems
  2. multiprogramming operating systems
  3. larger memory sized systems
  4. none of the mentioned

Answer: b, multiprogramming operating systems

Q2. A process is selected from the ______ queue by the ________ scheduler, to be executed..
  1. blocked, short term
  2. wait, long term
  3. ready, short term
  4. ready, long term

Answer: c, ready, short term

Q3. Which module gives control of the CPU to the process selected by the short-term scheduler?.
  1. dispatcher
  2. interrupt
  3. scheduler
  4. none of the mentioned

Answer: a, dispatcher

Q4. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____________.
  1. job queue
  2. ready queue
  3. execution queue
  4. process queue

Answer: b, ready queue

Q5. The interval from the time of submission of a process to the time of completion is termed as ____________.
  1. waiting time
  2. turnaround time
  3. response time
  4. throughput

Answer: b, turnaround time

Q6. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?.
  1. first-come, first-served scheduling
  2. shortest job scheduling
  3. priority scheduling
  4. none of the mentioned

Answer: a, first-come, first-served scheduling

Q7. In priority scheduling algorithm ____________.
  1. CPU is allocated to the process with highest priority
  2. CPU is allocated to the process with lowest priority
  3. Equal priority processes can not be scheduled
  4. None of the mentioned

Answer: a, CPU is allocated to the process with highest priority

Q8. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________.
  1. all process
  2. currently running process
  3. parent process
  4. init process

Answer: b, currently running process

Q9. Which algorithm is defined in Time quantum?.
  1. shortest job scheduling algorithm
  2. round robin scheduling algorithm
  3. priority scheduling algorithm
  4. multilevel queue scheduling algorithm

Answer: b, round robin scheduling algorithm

Q10. Process are classified into different groups in ____________.
  1. shortest job scheduling algorithm
  2. round robin scheduling algorithm
  3. priority scheduling algorithm
  4. multilevel queue scheduling algorithm

Answer: d, multilevel queue scheduling algorithm

Q11. In multilevel feedback scheduling algorithm ____________.
  1. a process can move to a different classified ready queue
  2. classification of ready queue is permanent
  3. processes are not classified into groups
  4. none of the mentioned

Answer: a, a process can move to a different classified ready queue

Q12. Which one of the following can not be scheduled by the kernel?.
  1. kernel level thread
  2. user level thread
  3. process
  4. none of the mentioned

Answer: b, user level thread

Q13. In the following cases non – preemptive scheduling occurs?.
  1. When a process switches from the running state to the ready state
  2. When a process goes from the running state to the waiting state
  3. When a process switches from the waiting state to the ready state
  4. All of the mentioned

Answer: b, When a process goes from the running state to the waiting state

Q14. The switching of the CPU from one process or thread to another is called ____________.
  1. process switch
  2. task switch
  3. context switch
  4. all of the mentioned

Answer: c, context switch

Q15. What is Dispatch latency?.
  1. the speed of dispatching a process from running to the ready state
  2. the time of dispatching a process from running to ready state and keeping the CPU idle
  3. the time to stop one process and start running another one
  4. none of the mentioned

Answer: c, the time to stop one process and start running another one

Q16. What is Turnaround time?.
  1. the total waiting time for a process to finish execution
  2. the total time spent in the ready queue
  3. the total time spent in the running queue
  4. the total time from the completion till the submission of a process

Answer: d, the total time from the completion till the submission of a process

Q17. What is Waiting time?.
  1. the total time in the blocked and waiting queues
  2. the total time spent in the ready queue
  3. the total time spent in the running queue
  4. the total time from the completion till the submission of a process

Answer: b, the total time spent in the ready queue

Q18. What is Response time?.
  1. the total time taken from the submission time till the completion time
  2. the total time taken from the submission time till the first response is produced
  3. the total time taken from submission time till the response is output
  4. none of the mentioned

Answer: b, the total time taken from the submission time till the first response is produced

Q19. Round robin scheduling falls under the category of ____________.
  1. Non-preemptive scheduling
  2. Preemptive scheduling
  3. All of the mentioned
  4. None of the mentioned

Answer: b, Preemptive scheduling

Q20. With round robin scheduling algorithm in a time shared system ____________.
  1. using very large time slices converts it into First come First served scheduling algorithm
  2. using very small time slices converts it into First come First served scheduling algorithm
  3. using extremely small time slices increases performance
  4. using very small time slices converts it into Shortest Job First algorithm

Answer: a, using very large time slices converts it into First come First served scheduling algorithm

Q21. What is FIFO algorithm?.
  1. first executes the job that came in last in the queue
  2. first executes the job that came in first in the queue
  3. first executes the job that needs minimal processor
  4. first executes the job that has maximum processor needs

Answer: b, first executes the job that came in first in the queue

Q22. What is Scheduling?.
  1. allowing a job to use the processor
  2. making proper use of processor
  3. all of the mentioned
  4. none of the mentioned

Answer: a, allowing a job to use the processor

Q23. Which of the following algorithms tends to minimize the process flow time?.
  1. First come First served
  2. Shortest Job First
  3. Earliest Deadline First
  4. Longest Job First

Answer: b, Shortest Job First

Q24. Which is the most optimal scheduling algorithm?.
  1. FCFS – First come First served
  2. SJF – Shortest Job First
  3. RR – Round Robin
  4. None of the mentioned

Answer: b, SJF – Shortest Job First

Q25. Which of the following scheduling algorithms gives minimum average waiting time?.
  1. FCFS
  2. SJF
  3. Round – robin
  4. Priority

Answer: b, SJF

Q26. What is ‘Aging’?.
  1. keeping track of cache contents
  2. keeping track of what pages are currently residing in memory
  3. keeping track of how many times a given page is referenced
  4. increasing the priority of jobs to ensure termination in a finite time

Answer: d, increasing the priority of jobs to ensure termination in a finite time

Q27. Choose one of the disadvantages of the priority scheduling algorithm?.
  1. it schedules in a very complex manner
  2. its scheduling takes up a lot of time
  3. it can lead to some low priority process waiting indefinitely for the CPU
  4. none of the mentioned

Answer: c, it can lead to some low priority process waiting indefinitely for the CPU