CUET PG 2024 — Computer PYQ

Q: How do I solve CUET PG 2024 Computer questions?

Practice CUET PG 2024 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.

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

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 2024 — Computer PYQ

CUET PG | Computer | 2024

An operating system contains 4 user processes each requiring 5 units of resource R. The minimum number of required units of R such that no deadlock will ever occur is

Choose the correct answer:

Explanation

The Logic

If each process needs 5 units, the maximum number of units a single process can hold without finishing is 4 units ( $5 - 1 = 4$ ).

If we have 4 processes, we calculate the maximum number of resources they can hold collectively without any of them being able to complete:

Number of processes ( $n$ ): 4
Units required per process ( $m$ ): 5
Maximum units held by one process without finishing: $m - 1 = 4$

The Equation

The formula to find the minimum number of resources ( $R$ ) to ensure no deadlock is:

R = n \times (m - 1) + 1

Plugging in your values:

R = 4 \times (5 - 1) + 1

R = 4 \times 4 + 1

R = 16 + 1

R = 17