Which of the following scheduling algorithms is non-preemptive?
In non-preemptive scheduling, once the CPU has been allocated to a process, the process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state. First-Come-First-Serve (FCFS) is a non-preemptive scheduling algorithm.
Reinforce your conceptual grasp with related questions from MAH MCA CET 2025:
Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →