List-I (Problem Classic) A. Bounded-Buffer B. Readers-Writers C. Dining Philosophers D. Sleeping Barber List-II (Core Sharing Constraint) Infinite readers allowed simultaneously; exclusive writer locks required. Circular dependency risks over a finite set of shared eating rods. Producer must stall on full slot count; consumer stalls on zero. Coordinate actions between a resource-provider and a waiting queue.

A-3, B-1, C-2, D-4 Explanation: A. Bounded-Buffer 3 : In the Producer-Consumer (Bounded-Buffer) problem, the producer must wait (stall) if the shared buffer is full, and the consumer must wait if the buffer is empty (zero elements). B. Readers-Writers 1 : Multiple readers can read shared data simultaneously without conflict, but a writer requires exclusive access to prevent data inconsistency. C. Dining Philosophers 2 : Demonstrates resource allocation and deadlock scenarios where philosophers compete for a limited set of shared chopsticks/eating rods, introducing circular dependency risks. D. Sleeping Barber 4 : Models process synchronization between a server/provider (barber) and a bounded queue of requesting processes (waiting chairs/customers). Therefore, the correct mapping is A-3, B-1, 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 (Problem Classic)

A. Bounded-Buffer

B. Readers-Writers

C. Dining Philosophers

D. Sleeping Barber

List-II (Core Sharing Constraint)

Infinite readers allowed simultaneously; exclusive writer locks required.

Circular dependency risks over a finite set of shared eating rods.

Producer must stall on full slot count; consumer stalls on zero.

Coordinate actions between a resource-provider and a waiting queue.

Choose the correct answer: