CUET PG 2025 — Computer PYQ

Q: How do I solve CUET PG 2025 Computer questions?

Practice CUET PG 2025 Computer 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 Computer questions?

CUET PG Computer 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 2025 — Computer PYQ

CUET PG | Computer | 2025

Which CPU scheduling algorithm prefers the process with the shortest burst time?

Choose the correct answer:

Explanation

Right Answer:

Shortest Job First (SJF) Scheduling

Solution:

SJF algorithm us process ko sabse pehle select karta hai jiska CPU Burst Time sabse kam hota hai. Iska mathematical logic niche diya gaya hai:

Maan lijiye hamare paas $n$ processes hain $\{P_1, P_2, \dots, P_n\}$ aur unke burst times $\{B_1, B_2, \dots, B_n\}$ hain. SJF us process $P_i$ ko pick karega jiske liye:

\text{Burst Time } (B_i) = \min \{B_1, B_2, \dots, B_n\}

Key Property:

SJF algorithm minimum average waiting time ( $\text{Avg. } W_t$ ) dene ke liye optimal mana jata hai: