Explain priority scheduling (preemptive , non-preemptive). Explain a case when a low priority process will preempt a high priority process

Question

Accepted Answer

Priority scheduling is a scheduling algorithm where processes are assigned priorities and executed based on their priority level.

Preemptive priority scheduling allows a higher priority process to interrupt a lower priority process that is currently running.
Non-preemptive priority scheduling allows a higher priority process to wait until the lower priority process finishes executing.
A low priority process can preempt a high priority process if the high priority process is waiting for a resource that is currently being used by the low priority process.
Another scenario where a low priority process can preempt a high priority process is when the high priority process is in a deadlock or infinite loop.

Top Carwale SDE (Software Development Engineer) interview questions & answers