Question: What is Priority CPU Sechduling Algorithm?

Answer: Priority scheduling is a non-preemptive algorithm and one of the most common scheduling algorithms in batch systems. Each process is assigned first arrival time (less arrival time process first) if two processes have same arrival time, then compare to priorities (highest process first). Also, if two processes have same priority then compare to process number (less process number first). This process is repeated while all process get executed.

Example: we have three processes P₁, P₂, P₃ their burst time are 6, 2, 14 and priority are 3, 2, 1