List-I A. Counting Semaphore B. Binary Semaphore C. Spinlock D. Monitor List-II A binary variable restricted to pure lock/unlock states. An integer control variable with unrestricted range values. A busy-waiting mechanism ideal for ultra-short lock holding. High-level programming language construct with explicit encapsulation.

A-2, B-1, C-3, D-4 Explanation: Each synchronization primitive matches its definition as follows: A. Counting Semaphore 2 : Uses an integer variable over an unrestricted domain/range to manage access to a resource with multiple available units. B. Binary Semaphore 1 : Restricts its value strictly to 0 and 1, functioning as a pure lock/unlock mechanism. C. Spinlock 3 : Keeps the process repeatedly testing a lock variable in a continuous loop ( busy-waiting ), making it effective for situations where lock acquisition times are extremely short. D. Monitor 4 : A high-level synchronization abstraction that encapsulates shared variables, procedures, and data structures within a single synchronization construct. Thus, the correct matching sequence is A-2, B-1, C-3, 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

A. Counting Semaphore

B. Binary Semaphore

C. Spinlock

D. Monitor

List-II

A binary variable restricted to pure lock/unlock states.

An integer control variable with unrestricted range values.

A busy-waiting mechanism ideal for ultra-short lock holding.

High-level programming language construct with explicit encapsulation.

Choose the correct answer: