Preemptive Priority Scheduling Algorithm (With example) || CPU SCHEDULING IN OS

In Preemptivew Priority Scheduling, at the time of arrival of a process in the ready queue, its Priority is compared with the priority of the other processes present in the ready queue as well as with the one which is being executed by the CPU at that point of time. The One with the highest priority among all the available processes will be given the CPU next. Preemptive scheduling is used when a process switches from running state to ready state or from waiting state to ready state.