How do I solve CUET PG 2025 Computer questions?

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

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.

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

CUET PG | Computer | 2025

Which of the following is a way to recover from the deadlock which has already occurred?

Choose the correct answer:

Explanation

Solution:

Deadlock recovery ke sandarbh mein, Banker's Algorithm ek Deadlock Avoidance algorithm hai. Yeh system ko 'Safe State' mein rakhne ke liye naya resource allocate karne se pehle check karta hai:

\text{Need}[i][j] = \text{Max}[i][j] - \text{Allocation}[i][j]

Safe Condition: Ek state 'Safe' tabhi hoti hai jab:

\text{Available} \geq \text{Need}[i]

Right Answer (as per your option):

Banker's Algorithm (Used for Deadlock Avoidance)