Match List-I with List-II List-I List-II A. Bellman-Ford algorithm (with adjacency list representation) I. O(|V| 2 ) B. Dijkstra Algorithm II. O((V+E)logV) C Prim’s Algorithm III. O(nm) D. Topological sorting (with adjacency list representation) IV. O(n+m) Choose the correct answer from the options given below

A-III, B-I, C-II, D-IV Explanation: Mathematical Logic 1. Bellman-Ford (A - III): Isme har edge ( ) ko ( ) baar relax kiya jata hai: 2. Dijkstra Algorithm (B - I): Jab Dijkstra ko simple Adjacency Matrix ke saath implement karte hain, toh complexity hoti hai: 3. Prim’s Algorithm (C - II): Jab Prim's ko Adjacency List aur Min-Heap (Priority Queue) ke saath implement karte hain, toh complexity hoti hai: 4. Topological Sorting (D - IV): Adjacency list ka use karke linear time mein result milta hai: Final Sequence: A-III, B-I, C-II, D-IV

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.

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.

CUET PG 2024 — Computer PYQ

CUET PG | Computer | 2024

Match List-I with List-II

List-I		List-II
A.	Bellman-Ford algorithm (with adjacency list representation)	I.	O(\|V\|²)
B.	Dijkstra Algorithm	II.	O((V+E)logV)
C	Prim’s Algorithm	III.	O(nm)
D.	Topological sorting (with adjacency list representation)	IV.	O(n+m)

Choose the correct answer from the options given below

Choose the correct answer: