Matching Column A Column B A. BFS I. Shortest Path B. Sparse graph II. Adjacency list representation C. Collision Resolution III. Open Addressing D. Linked list IV. Self Referential structure

(A)-I, (B)-II, (C)-III, (D)-IV Explanation: Solution To find the correct match, let's analyze each term in Column A: A. BFS (Breadth-First Search): In an unweighted graph, is primarily used to find the Shortest Path from a source node to all other nodes because it explores nodes layer by layer. Matches with: I B. Sparse graph: A graph is considered "sparse" if the number of edges is much less than the maximum possible edges (roughly ). For such graphs, an Adjacency list representation is more memory-efficient than an adjacency matrix. Matches with: II C. Collision Resolution: In Hashing, when two keys map to the same index, a collision occurs. Open Addressing (like linear probing or quadratic probing) is a common technique used for collision resolution. Matches with: III D. Linked list: A linked list is implemented using a Self Refe

How do I solve CUET PG 2026 Computer questions?

Practice CUET PG 2026 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.

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.

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.

+91 99359 65550 contact@maarula.in

Mathem Solvex

Get the solution of every question

Preparing for Excellence...

CUET PG 2026 Computer PYQ — Matching Column A Column B A. BFS I. Shortest Path B. Sparse grap… | Mathem Solvex | Mathem Solvex

Tip:A–D to answerE for explanationV for videoS to reveal answer

CUET PG 2026 — Computer PYQ

CUET PG | Computer | 2026

Matching

	Column A		Column B
A.	BFS	I.	Shortest Path
B.	Sparse graph	II.	Adjacency list representation
C.	Collision Resolution	III.	Open Addressing
D.	Linked list	IV.	Self Referential structure

Mathem Solvex

CUET PG 2026 — Computer PYQ

Explanation

Solution

Conclusion

Explanation

Solution

Conclusion