Matching: Minimum Spanning Tree Height balanced Topological Sort Stack Recursion Kruskal's algorithm AVL Tree DFS

Explanation: Solution: Minimum Spanning Tree : Kruskal's algorithm ( ) is a famous greedy algorithm used to find the MST of a graph. Topological Sort : Topological sorting for a Directed Acyclic Graph (DAG) can be implemented using DFS ( ) by pushing nodes onto a stack after visiting their neighbors. Recursion : System Stacks ( ) are used internally to manage recursive function calls and local variables. AVL Tree : An AVL tree is a self-regulating, Height balanced ( ) binary search tree. Matches: Correct Option: (d)

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: Minimum Spanning Tree Height balanced Topological Sort … | 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:


$(A)$	Minimum Spanning Tree	$I.$	Height balanced
$(B)$	Topological Sort	$II.$	Stack
$(C)$	Recursion	$III.$	Kruskal's algorithm
$(D)$	AVL Tree	$IV.$	DFS