Aspire Faculty ID #12117 · Topic: CUET 2025 · Just now
CUET 2025

Match List-I with List-II
List - I List - II
(CPU Scheduling Algorithm) (Feature)
(A) FCFS (I) FCFS + preemption
(B) Round Robin (II) Allows the processes to move between queues
(C) Multi-level queue scheduling (III) Often long average waiting time
(D) Multi-level Feedback Queue (IV) Permanent assignment of processes to one specific queue

 Choose the correct answer from the options given below:

1. (A) - (I), (B) - (II), (C) - (III), (D) - (IV) 
2. (A) - (III), (B) - (I), (C) - (IV), (D) - (II) 
3. (A) - (I), (B) - (II), (C) - (IV), (D) - (III) 
4. (A) - (III), (B) - (IV), (C) - (I), (D) - (II)

Solution

List-I (Algorithms) and their correct features:

  • (A) FCFS (First Come First Serve) → It is non-preemptive and can cause long average waiting time if a long job arrives first.
    ⇒ Matches with (III).

  • (B) Round Robin → It is essentially FCFS with preemption (time quantum).
    ⇒ Matches with (I).

  • (C) Multi-level queue scheduling → Each process is permanently assigned to a fixed queue (like system, interactive, batch).
    ⇒ Matches with (IV).

  • (D) Multi-level feedback queue → Allows processes to move between queues depending on behavior/CPU burst.
    ⇒ Matches with (II).

Correct Matching:

Previous 10 Questions — CUET 2025

Nearest first

Next 10 Questions — CUET 2025

Ascending by ID
Ask Your Question or Put Your Review.

loading...