Explanation:

In operating systems, CPU scheduling algorithms are used to determine the order in which processes are executed by the CPU. These algorithms play a crucial role in managing the CPU's resources efficiently and ensuring that all processes receive fair access to the CPU. There are several CPU scheduling algorithms, and in this case, all of the options mentioned (a, b, and c) are correct.

Priority Scheduling:
Priority scheduling is an algorithm where each process is assigned a priority value, and the CPU is allocated to the process with the highest priority. This algorithm can be either preemptive or non-preemptive. In preemptive priority scheduling, if a new process with a higher priority arrives, the CPU is preempted from the current process and given to the higher priority process.

Round Robin Scheduling:
Round Robin scheduling is a preemptive scheduling algorithm in which each process is assigned a fixed time quantum. The CPU executes each process for a certain amount of time (time quantum) and then switches to the next process in a circular manner. This algorithm ensures fairness by giving each process an equal opportunity to execute.

Shortest Job First Scheduling:
Shortest Job First (SJF) scheduling is a non-preemptive scheduling algorithm where the process with the shortest burst time is executed first. This algorithm minimizes the average waiting time and is ideal for environments where the burst time of processes is known in advance.

Therefore, all of the mentioned options (a, b, and c) are CPU scheduling algorithms commonly used in operating systems. Each algorithm has its own advantages and disadvantages, and the choice of algorithm depends on the specific requirements of the system and the nature of the processes being scheduled.

In Operating Systems, which of the following is/are CPU scheduling algorithms?