4. Can non-preemptive scheduling algorithms adapt to dynamic workloads?

Non-preemptive scheduling algorithms are generally not as adaptable to dynamic workloads compared to preemptive scheduling algorithms. They may struggle to handle scenarios where tasks with shorter arrival times require immediate execution.

5. What are the challenges of using non-preemptive scheduling algorithms?

One challenge of non-preemptive scheduling algorithms is the potential for delays or missed deadlines when tasks with shorter arrival times are present. These algorithms may also struggle to prioritize tasks effectively in highly dynamic environments.