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 queses (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 gven below:

(A) - (III), (B) - (I), (C) - (IV), (D) - (II) Explanation: The correct matches are as follows: (A) FCFS matches with (III) Often long average waiting time . FCFS is a non-preemptive algorithm where a long job arriving first can make subsequent short jobs wait for a long time, leading to the "convoy effect" and high average waiting time. (B) Round Robin matches with (I) FCFS + preemption . Round Robin is a preemptive scheduling algorithm that uses a time quantum and treats the ready queue as a circular FCFS queue, switching between processes after each time slice. (C) Multi level queue scheduling matches with (IV) Permanent assignment of processes to one specific queue . In multi-level queue scheduling, processes are permanently assigned to a queue based on their properties (e.g., system, interactive, batch), and they do not move between queues. (D

How do I solve CUET PG 2025 Computer questions?

Practice CUET PG 2025 Computer previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

What is the difficulty level of CUET PG Computer questions?

CUET PG Computer questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Are CUET PG previous year papers available for free?

Yes. Mathem Solvex provides free access to CUET PG previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

CUET PG 2025 — Computer PYQ

CUET PG | Computer | 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 queses
(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 gven below:

Choose the correct answer: