Question:medium

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{FCFS} & (III)\ \text{Often long average waiting time} \\ \hline (B)\ \text{Round Robin} & (I)\ \text{FCFS + preemption} \\ \hline (C)\ \text{Multi-level queue scheduling} & (IV)\ \text{Permanent assignment of processes to one specific queue} \\ \hline (D)\ \text{Multi-level Feedback Queue} & (II)\ \text{Allows the processes to move between queues} \\ \hline \end{array}\] Choose the correct answer from the options given below:

Show Hint

Remember the difference between FCFS and preemptive versions. Round Robin allows processes to move between queues, while Multi-level Feedback Queue involves dynamic movement between queues.
Updated On: Mar 7, 2026
  • (A) - (I), (B) - (II), (C) - (III), (D) - (IV)
  • (A) - (III), (B) - (I), (C) - (IV), (D) - (II)
  • (A) - (I), (B) - (III), (C) - (IV), (D) - (II)
  • (A) - (III), (B) - (II), (C) - (IV), (D) - (I)
Show Solution

The Correct Option is A

Solution and Explanation

Step 1: Algorithm Descriptions.
- FCFS (First Come First Serve): A non-preemptive algorithm that schedules processes by their arrival sequence. Including preemption transforms it into FCFS + preemption (I).
- Round Robin: Processes are allocated a fixed time quantum and can transition between queues (II).
- Multi-level queue scheduling: Processes are assigned to queues based on priority or other factors, often resulting in extended average waiting times (III).
- Multi-level Feedback Queue: Processes can migrate between queues based on their activity; this algorithm does not permanently assign processes to a single queue (IV).

Step 2: Matching Exercise.
- (A) FCFS corresponds to (I) FCFS + preemption.
- (B) Round Robin corresponds to (II) Processes may move between queues.
- (C) Multi-level queue scheduling corresponds to (III) Frequently results in a long average waiting time.
- (D) Multi-level Feedback Queue corresponds to (IV) Processes are permanently allocated to a specific queue.

Step 3: Final Result.
The correct pairings are (A) - (I), (B) - (II), (C) - (III), (D) - (IV).

Was this answer helpful?
0