Answer - The scheduling algorithms decide which processes in the ready queue are to be allocated to the CPU for execution. Scheduling algorithms can be broadly classified on the basis of: - Preemptive algorithms - Round Robin Scheduling - Shortest Job First Scheduling (can be both) - Priority Scheduling (can be both) - Non-preemptive algorithms - First Come First Served Scheduling Non-Preemptive algorithms: In this type of scheduling once a CPU has been allocated to a process it would not release the CPU till a request for termination or switching to waiting state occurs. Preemptive algorithms: In this type of scheduling a process maybe interrupted during execution and the CPU maybe allocated to another process.