Preemptive Priority CPU Scheduling Algorithm is a pre-emptive method of CPU scheduling algorithm that works based on the priority of a process

Characteristics of Preemptive Priority Scheduling :

Schedules tasks based on priority.
When the higher priority work arrives while a task with less priority is executed, the higher priority work takes the place of the less priority one and The latter is suspended until the execution is complete.
Lower is the number assigned, higher is the priority level of a process.

Advantages of Preemptive Priority Scheduling :

The average waiting time is less than FCFS.
Less complex.

Disadvantages of Preemptive Priority Scheduling :

One of the most common demerits of the Preemptive priority CPU scheduling algorithm is the Starvation Problem.