Classic Synchronization Problems List-I (Problem Name) A. Bounded-Buffer B. Readers-Writers C. Dining Philosophers D. Sleeping Barber List-II (Core Resource Constraint) Producer stops if buffer is full; consumer stops if buffer is empty Multiple readers allowed concurrently, but writers need exclusive access Five thinkers share five chopsticks; requires adjacent allocations Synchronizes interaction between a service provider and a waiting room

A-1, B-2, C-3, D-4 Explanation: A. Bounded-Buffer -> 1. Producer stops if buffer is full; consumer stops if buffer is empty Bounded-Buffer (Producer-Consumer) problem me producer tab rukta hai jab buffer full ho jaye, aur consumer tab rukta hai jab buffer khali (empty) ho. B. Readers-Writers -> 2. Multiple readers allowed concurrently, but writers need exclusive access Readers-Writers problem me ek saath multiple readers read kar sakte hain, lekin writer ko exclusive access chahiye hota hai taaki data inconsistent na ho. C. Dining Philosophers -> 3. Five thinkers share five chopsticks; requires adjacent allocations Dining Philosophers problem me 5 philosophers 5 chopsticks share karte hain, jahan khana khane ke liye dono adjacent (aaghal-baghal) chopsticks ki zarurat hoti hai. D. Sleeping Barber -> 4. Synchronizes intera

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

Classic Synchronization Problems

List-I (Problem Name)

A. Bounded-Buffer

B. Readers-Writers

C. Dining Philosophers

D. Sleeping Barber

List-II (Core Resource Constraint)

Producer stops if buffer is full; consumer stops if buffer is empty
Multiple readers allowed concurrently, but writers need exclusive access
Five thinkers share five chopsticks; requires adjacent allocations
Synchronizes interaction between a service provider and a waiting room

Choose the correct answer: