List-I (Real-Time Algorithm) A. Rate-Monotonic B. Earliest-Deadline-First C. Hard Real-Time D. Soft Real-Time List-II (Priority Assignment Policy) Static priority based on period; shorter period gets higher priority Dynamic priority based on proximity to the nearest deadline Strict constraints; missing a deadline causes critical system failure Deadlines are preferred but missing them causes degraded quality, not failure

A-1, B-2, C-3, D-4 Explanation: A. Rate-Monotonic 1. Static priority based on period; shorter period gets higher priority Rate-Monotonic Scheduling (RMS) ek static priority algorithm hai. Isme jis task ka period sabse chhota (shorter period) hota hai, uski frequency/rate high hoti hai aur use highest priority di jati hai. B. Earliest-Deadline-First 2. Dynamic priority based on proximity to the nearest deadline Earliest-Deadline-First (EDF) ek dynamic priority scheduling algorithm hai. Isme priorities run-time par assign hoti hain; jis task ki deadline jitni paas (nearest deadline) hoti hai, use utni hi high priority milti hai. C. Hard Real-Time 3. Strict constraints; missing a deadline causes critical system failure Hard Real-Time systems me strict deadlines hoti hain. Agar ek bhi deadline miss hoti hai, toh poora system

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 (Real-Time Algorithm)

A. Rate-Monotonic

B. Earliest-Deadline-First

C. Hard Real-Time

D. Soft Real-Time

List-II (Priority Assignment Policy)

Static priority based on period; shorter period gets higher priority

Dynamic priority based on proximity to the nearest deadline

Strict constraints; missing a deadline causes critical system failure

Deadlines are preferred but missing them causes degraded quality, not failure

Choose the correct answer: