CUET PG 2026 — operating system os PYQ

Q: 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.

Q: 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.

Q: 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.

Question

CUET PG 2026 — operating system os PYQ

CUET PG | operating system os | 2026

Assertion (A): Belady's anomaly states that the page-fault rate always decreases monotonically as the number of allocated frames increases for the Least Recently Used (LRU) replacement algorithm.

Reason (R): The FIFO page replacement algorithm can experience an increase in page faults when the number of allocated frames is increased for specific reference strings.

Choose the correct answer:

Explanation

Assertion (A) is False: Belady's anomaly refers to the phenomenon where increasing the number of allocated frames can sometimes increase the number of page faults. Additionally, stack algorithms like LRU (Least Recently Used) do not suffer from Belady's anomaly; their page-fault rate never increases as the number of frames increases.
Reason (R) is True: The FIFO (First-In, First-Out) page replacement algorithm is a classic example of an algorithm that can experience an increase in page faults when more frames are allocated for certain reference strings.