Match List-I with List-II: List-I (Term) A. Banker's Algorithm B. Deadlock Prevention C. Deadlock Detection D. Spooling List-II (Associated Mechanism) Resource Allocation Graph cycle detection Safe state check for deadlock avoidance Eliminating one of the four necessary conditions Overlapping I/O operations with CPU processing

A - 2, B - 1, C - 3, D - 4 Explanation: A. Banker's Algorithm 2: Banker's Algorithm ek Deadlock Avoidance technique hai jo resources allocate karne se pehle system ko Safe state me check karti hai. B. Deadlock Prevention 3: Deadlock Prevention me deadlock ki charo necessary conditions (Mutual Exclusion, Hold & Wait, No Preemption, Circular Wait) me se kam se kam ek condition ko eliminate/break kiya jata hai. C. Deadlock Detection 1: Single-instance resources ke case me deadlock ko detect karne ke liye Resource Allocation Graph (RAG) me cycle detect ki jaati hai. D. Spooling 4: Spooling (Simultaneous Peripheral Operations On-Line) I/O devices ki speed aur CPU processing ke beech overlap karke operational efficiency badhata hai.

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

Match List-I with List-II:

List-I (Term)

A. Banker's Algorithm

B. Deadlock Prevention

C. Deadlock Detection

D. Spooling

List-II (Associated Mechanism)

Resource Allocation Graph cycle detection

Safe state check for deadlock avoidance

Eliminating one of the four necessary conditions

Overlapping I/O operations with CPU processing

Choose the correct answer: