MCAPREP
Home > PYQ Blogs > CUET-MCA 2025 Paper > Question 47

Question 47

Computer Awareness I/O Management and CPU Scheduling Medium

Match List-I with List-II. $$ \begin{array}{|c|l|} \hline \textbf{List-I (CPU Scheduling Algorithm)} & \textbf{List-II (Feature)} \\ \hline (A)\ \text{FCFS} & (I)\ \text{FCFS + preemption} \\ \hline (B)\ \text{Round Robin} & (II)\ \text{Allows the processes to move between queues} \\ \hline (C)\ \text{Multi level queue scheduling} & (III)\ \text{Often long average waiting time} \\ \hline (D)\ \text{Multi-level Feedback Queue} & (IV)\ \text{Permanent assignment of processes to one specific queue} \\ \hline \end{array} $$

(A) (A)-(I), (B)-(II), (C)-(III), (D)-(IV)
(B) (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
(C) (A)-(I), (B)-(II), (C)-(IV), (D)-(III)
(D) (A)-(III), (B)-(IV), (C)-(I), (D)-(II)
View Dynamic Solution & Explanation ▼
Correct Solution: Option B

Step-by-step Solution:

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

← Previous Question Our Rankers Next Question →