List-I (Condition) A. Mutual Exclusion B. Hold and Wait C. No Preemption D. Circular Wait List-II (System Structural State) At least one resource must be held in a non-sharable mode. Resources cannot be forcibly taken from a process holding them. A process holds allocated units while waiting for additional allocations. A closed chain of processes exists where each waits for the next.

A-1, B-3, C-2, D-4 Explanation: The four Coffman conditions necessary for a deadlock to occur are defined as follows: A. Mutual Exclusion 1 : At least one resource must be held in a non-sharable mode, meaning only one process can use the resource at any given time. B. Hold and Wait 3 : A process must be holding at least one resource while simultaneously waiting to acquire additional resources that are currently held by other processes. C. No Preemption 2 : Resources cannot be forcibly taken away from a process; they can only be released voluntarily by the process after it has completed its task. D. Circular Wait 4 : A closed chain or set of waiting processes must exist such that is waiting for a resource held by , is waiting for , and is waiting for . Therefore, the correct mapping is A-1, B-3, C-2, 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 (Condition)

A. Mutual Exclusion

B. Hold and Wait

C. No Preemption

D. Circular Wait

List-II (System Structural State)

At least one resource must be held in a non-sharable mode.

Resources cannot be forcibly taken from a process holding them.

A process holds allocated units while waiting for additional allocations.

A closed chain of processes exists where each waits for the next.

Choose the correct answer: