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): If a Resource Allocation Graph (RAG) contains a single instance of each resource type and exhibits a cycle, a deadlock definitely exists.

Reason (R): A cycle in a single-instance resource allocation graph is both a necessary and a sufficient condition for the existence of a deadlock.

Choose the correct answer:

Explanation

Assertion (A) is True:
When each resource type has only a single instance, the presence of a cycle in the Resource Allocation Graph (RAG) guarantees that a deadlock exists.
Reason (R) is True:
For single-instance resource systems, a cycle is both a necessary condition (if there is a deadlock, there must be a cycle) and a sufficient condition (if there is a cycle, a deadlock definitely exists).
Correct Explanation:
Since Reason (R) correctly states the fundamental rule that makes Assertion (A) true, R is the correct explanation of A.