CUET PG 2024 — Computer PYQ

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

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

CUET PG | Computer | 2024

How does the number of page frames affect the number of page faults for a given memory access pattern in FIFO page replacement algorithm?

Choose the correct answer:

A.
Increasing the number of page frames always decreases the number of page faults.
B.
Increasing the number of page frames may increase or decrease the number of page faults depending on the memory access pattern.
(Correct Answer)
C.
Increasing the number of page frames always increases the number of page faults.
D.
Increasing the number of page frames has no effect on the number of page faults.

Explanation

Mathematical Representation

Standard case mein rule ye hona chahiye:

\text{Frames} (f) \propto \frac{1}{\text{Page Faults} (PF)}

Lekin FIFO ke liye, specific access patterns (जैसे: $1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5$ ) mein ye relation badal jata hai:

\text{If } f_2 > f_1 \implies PF(f_2) > PF(f_1) \quad (\text{Belady's Anomaly})

Conclusion

Is statement ka matlab hai:

Decrease: Zyadatar cases mein frames badhane se faults kam hote hain (Normal behavior).
Increase: Kuch patterns mein frames badhane se faults badh jate hain (Anomaly behavior).

Isliye combined statement banta hai:

\mathbf{\text{Frames} \uparrow \implies \text{Page Faults may Increase or Decrease}}

Answer: Bilkul sahi, ye FIFO algorithm ki sabse badi limitation hai.