1. CPU scheduling deals with:
A) Allocation of memory
B) Allocation of CPU to processes
C) Allocation of I/O devices
D) Allocation of files
B) Allocation of CPU to processes
2. Which CPU scheduling algorithm is simplest?
A) Shortest Job First
B) Priority Scheduling
C) First Come First Serve
D) Round Robin
C) First Come First Serve
3. Which scheduling algorithm can cause the convoy effect?
A) SJF
B) Round Robin
C) FCFS
D) Priority
C) FCFS
4. Which scheduling algorithm gives minimum average waiting time?
A) FCFS
B) SJF
C) Round Robin
D) Priority
B) SJF
5. Preemptive scheduling means:
A) Process releases CPU voluntarily
B) CPU is forcibly taken from a process
C) CPU is shared equally
D) Process finishes execution
B) CPU is forcibly taken from a process
6. Which of the following is a preemptive scheduling algorithm?
A) FCFS
B) Non-preemptive SJF
C) Priority (preemptive)
D) FCFS with I/O
C) Priority (preemptive)
7. In Round Robin scheduling, the time quantum should be:
A) Very large
B) Very small
C) Equal to burst time
D) Infinite
B) Very small
8. If time quantum is too large, Round Robin scheduling becomes similar to:
A) SJF
B) Priority
C) FCFS
D) Multilevel queue
C) FCFS
9. Which scheduling algorithm may suffer from starvation?
A) FCFS
B) SJF
C) Priority
D) Both B and C
D) Both B and C
10. Starvation can be prevented using:
A) Preemption
B) Aging
C) Deadlock avoidance
D) Mutual exclusion
B) Aging
11. Which scheduling algorithm is best for time-sharing systems?
A) FCFS
B) SJF
C) Round Robin
D) Priority
C) Round Robin
12. Turnaround time is defined as:
A) Time between arrivals of processes
B) Completion time minus arrival time
C) Waiting time plus burst time only
D) CPU idle time
B) Completion time minus arrival time
13. Waiting time is:
A) Turnaround time minus burst time
B) Burst time minus turnaround time
C) Arrival time minus completion time
D) CPU execution time
A) Turnaround time minus burst time
14. Response time is the time between:
A) Arrival and completion
B) Arrival and first CPU allocation
C) Waiting and execution
D) Completion and termination
B) Arrival and first CPU allocation
15. Which scheduling algorithm uses priority values?
A) FCFS
B) SJF
C) Priority scheduling
D) Round Robin
C) Priority scheduling
16. In non-preemptive scheduling:
A) CPU can be taken anytime
B) Process releases CPU voluntarily
C) CPU is shared among all processes
D) Context switching is compulsory
B) Process releases CPU voluntarily
17. Which metric is most important for interactive systems?
A) Turnaround time
B) Waiting time
C) Response time
D) Throughput
C) Response time
18. Throughput refers to:
A) CPU utilization
B) Number of processes completed per unit time
C) Average waiting time
D) Response time
B) Number of processes completed per unit time
19. CPU utilization should be:
A) Minimum
B) Maximum
C) Zero
D) Constant
B) Maximum
20. Which scheduling algorithm requires knowledge of future CPU burst times?
A) FCFS
B) Round Robin
C) SJF
D) Priority
C) SJF
21. Multilevel queue scheduling:
A) Uses one ready queue
B) Allows process migration between queues
C) Has multiple ready queues
D) Is same as Round Robin
C) Has multiple ready queues
22. Which scheduling algorithm assigns a fixed time slot to each process?
A) FCFS
B) SJF
C) Priority
D) Round Robin
D) Round Robin
23. Context switching overhead increases when:
A) Time quantum is large
B) Time quantum is small
C) Burst time is large
D) Arrival rate is low
B) Time quantum is small
24. Which scheduling algorithm is non-preemptive by default?
A) SJF
B) Priority
C) Round Robin
D) Multilevel queue
A) SJF
25. Which scheduling criterion measures how busy the CPU is?
A) Throughput
B) Turnaround time
C) CPU utilization
D) Waiting time
C) CPU utilization