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

Consider a page refrence string as : 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, Assume that there are 3-page frames available. calculate the total number of pages faults for the above reference string if LRU policy is used for page replacement.

Choose the correct answer:

Explanation

Step 1: Initialize Simulation Parameters

We have a page reference string of

R=[7,0,1,2,0,3,0,4,2,3,0,3,2]cap R equals open bracket 7 comma 0 comma 1 comma 2 comma 0 comma 3 comma 0 comma 4 comma 2 comma 3 comma 0 comma 3 comma 2 close bracket

𝑅=[7,0,1,2,0,3,0,4,2,3,0,3,2]

and a memory capacity of

N=3cap N equals 3

𝑁=3

page frames. We simulate the Least Recently Used (LRU) algorithm, where the least recently accessed page is replaced upon a page fault when all frames are full. A page fault occurs when the requested page is not in the current frames.

Step 2: Trace Page References

The simulation proceeds as follows. The frames are tracked in order of LRU (left) to Most Recently Used (right). The status indicates whether a page fault (PF) or a hit occurred.

Reference	Frames (LRU →right arrow → MRU)	Status	Total Faults
7	[7]	PF	1
0	[7, 0]	PF	2
1	[7, 0, 1]	PF	3
2	[0, 1, 2]	PF	4
0	[1, 2, 0]	Hit	4
3	[2, 0, 3]	PF	5
0	[2, 3, 0]	Hit	5
4	[3, 0, 4]	PF	6
2	[0, 4, 2]	PF	7
3	[4, 2, 3]	PF	8
0	[2, 3, 0]	PF	9
3	[2, 0, 3]	Hit	9
2	[0, 3, 2]	Hit	9

Step 3: Count Total Page Faults

By tracing the execution of the LRU algorithm through the entire reference string, we count the total number of times a page fault occurred.

Answer:

9