Solution

We are asked to match CPU scheduling algorithms with their key features.

• FCFS (First Come First Serve) → Often long average waiting time (III): FCFS schedules processes in the order of arrival, which can lead to long waiting times if a long process arrives first.
• Round Robin → FCFS + preemption (I): Round Robin is a preemptive version of FCFS where each process gets a time slice (quantum).
• Multi-level Queue Scheduling → Permanent assignment of processes to one specific queue (IV): Processes are permanently assigned to a queue based on priority or type.
• Multi-level Feedback Queue → Allows processes to move between queues (II): This scheduling allows processes to move between queues based on their behavior and execution history.

Thus, the correct matching is:

(A)-(III), (B)-(I), (C)-(IV), (D)-(II)

Answer: Option B