List-I A. Non-Preemptive SJF B. Preemptive SJF (SRTF) C. Round Robin D. Multi-Level Feedback Queue List-II Minimizes average waiting time but requires burst prediction. Switches execution whenever a shorter remaining burst arrives. Starvation-free due to fixed rotational time slices. Dynamically adjusts process priority based on execution history.

A-1, B-2, C-3, D-4 Explanation: A. Non-Preemptive SJF 1 : SJF (Shortest Job First) minimizes the average waiting time for a set of processes, but it requires prior knowledge or prediction of CPU burst time. B. Preemptive SJF (SRTF) 2 : Shortest Remaining Time First (SRTF) preempts the currently executing process whenever a new process arrives with a shorter remaining CPU burst time. C. Round Robin 3 : Round Robin uses fixed time quantums (rotational time slices) to serve every process sequentially in a circular queue, ensuring no process starves. D. Multi-Level Feedback Queue 4 : Allows processes to move between queues depending on their execution behavior and CPU burst history, dynamically adjusting process priority. Hence, the correct mapping is A-1, B-2, C-3, D-4 .

How do I solve CUET PG 2026 operating system os questions?

Practice CUET PG 2026 operating system os 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 operating system os questions?

CUET PG operating system os 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 2026 — operating system os PYQ

CUET PG | operating system os | 2026

List-I

A. Non-Preemptive SJF

B. Preemptive SJF (SRTF)

C. Round Robin

D. Multi-Level Feedback Queue

List-II

Minimizes average waiting time but requires burst prediction.

Switches execution whenever a shorter remaining burst arrives.

Starvation-free due to fixed rotational time slices.

Dynamically adjusts process priority based on execution history.

Choose the correct answer: