Match the columns.

Match List - I with List – II.

List - I (Algorithms)	List - II (Characteristics)
A.	First Come Fist Served (FCFS)	I.	Each process is assigned a priority.
B.	Shortest Job First (SJF)	II.	Ensures fair allocation of CPU time by assigning time slice.
C.	Round Robin (RR)	III.	Processes are executed in the order they arrive.
D.	Priority Scheduling	IV.	Select the process for execution with smallest next Burst time.

Choose the correct answer from the options given below:

Correct option is C

This question tests the understanding of different CPU scheduling algorithms and their respective characteristics. Each algorithm uses a unique scheduling strategy to manage process execution, especially in a multitasking operating system environment.
1. First Come First Served (FCFS) - This is a basic scheduling algorithm where processes are executed in the order they arrive. It is simple and non-preemptive.
2. Shortest Job First (SJF) - This algorithm selects the process with the smallest burst time for execution, which helps in minimizing the average waiting time.
3. Round Robin (RR) - In Round Robin scheduling, each process is given a fixed time slice, ensuring fair allocation of CPU time among all processes.
4. Priority Scheduling - This algorithm assigns a priority to each process and allocates CPU time based on the priority, where processes with higher priority are executed first.
Information Booster:
· A - III (First Come First Served - FCFS):
· FCFS executes processes in the exact order they arrive in the ready queue.
· This is a straightforward, non-preemptive scheduling approach.
· It does not prioritize short tasks over long ones, which can lead to the "convoy effect," where shorter processes get stuck waiting for a long process to finish.
· B - IV (Shortest Job First - SJF):
· SJF chooses the process with the shortest burst time for execution, reducing average waiting time in the system.
· It can operate in both preemptive and non-preemptive modes, though it is more effective in preemptive mode (Shortest Remaining Time First).
· This scheduling method is optimal in reducing waiting time but requires accurate knowledge of burst times, which is not always feasible.
· C - II (Round Robin - RR):
· Round Robin scheduling allocates a fixed time slice (quantum) to each process in a cyclic order, ensuring fair CPU time distribution.
· It is ideal for time-sharing environments where response time is a critical factor.
· Each process gets a fair chance, which prevents starvation but can increase the overhead due to frequent context switching.
· D - I (Priority Scheduling):
· Priority Scheduling assigns a priority to each process, and the CPU is allocated to the process with the highest priority.
· This algorithm can be preemptive or non-preemptive, depending on whether high-priority tasks can interrupt ongoing tasks.
· While effective, it can lead to starvation of low-priority processes unless techniques like aging are used.