CUET PG 2026 — operating system os PYQ

Q: 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.

Q: 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.

Q: 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.

Question

CUET PG 2026 — operating system os PYQ

CUET PG | operating system os | 2026

Assertion (A): Shortest Remaining Time First (SRTF) is the preemptive version of the Shortest Job First (SJF) scheduling algorithm.

Reason (R): SRTF guarantees that the average waiting time is maximized among all available non-preemptive scheduling strategies.

Choose the correct answer:

Explanation

Assertion (A) is True: Shortest Remaining Time First (SRTF) is indeed the preemptive version of Shortest Job First (SJF) CPU scheduling, where a currently running process is preempted if a new process arrives with a CPU burst shorter than the remaining time of the current process.
Reason (R) is False: SRTF (and SJF) actually minimizes the average waiting time among all scheduling algorithms, rather than maximizing it. Furthermore, SRTF is preemptive, whereas the reason incorrectly refers to it as a non-preemptive strategy.
Conclusion: Since Assertion (A) is true and Reason (R) is false, the correct option is C.