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): Shortest Seek Time First (SSTF) disk scheduling algorithm can cause starvation for requests situated at the extremes of the disk surface.

Reason (R): SSTF selects the request closest to the current disk head position, which can continuously favor middle requests and leave peripheral requests unattended under heavy load.

Choose the correct answer:

Explanation

Assertion (A) is True: The Shortest Seek Time First (SSTF) algorithm services requests closest to the current head position first. If a continuous stream of new requests keeps arriving near the middle tracks, requests located at the outer edges (extremes) of the disk can experience indefinite waiting time, known as starvation.
Reason (R) is True and is the Correct Explanation: Because SSTF always chooses the minimum seek time from the current head position, the head tends to remain localized in regions where request density is high (often the middle). This behavior directly causes peripheral requests to be ignored under heavy load, validating both the statement and why it happens.