1. Which scheduling algorithm is non-preemptive?
2. In FCFS scheduling, the process that arrives first is:
3. Which scheduling algorithm is optimal for minimizing average waiting time?
4. In Round Robin scheduling, if the time quantum is too large, it behaves like:
5. Which scheduling algorithm can lead to starvation?
6. In SJF scheduling, the process with the shortest burst time is:
7. Which scheduling algorithm uses a fixed time slice for each process?
8. In Priority Scheduling, a lower priority number usually indicates:
9. Which scheduling algorithm is preemptive?
10. Multi-Level Feedback Queue (MLFQ) scheduling is designed to:
11. Which scheduling algorithm is most suitable for time-sharing systems?
12. In MLFQ, processes can move between queues based on:
13. Which scheduling algorithm is most likely to cause convoy effect?
14. In Priority Scheduling, aging is used to:
15. Which scheduling algorithm is most complex to implement?