Match List-I with List-II List-1 List-II (Algorithm) (Recurrence relation) (A) Binary Search (I) (B) Merge Sort (II) (C) Quick sort (worst case partitioning (III) (D) Linear Search (IV) Choose the correct answer from the options given below:

(A)(1), (B) (II), (C) - (III), (D) - (IV) Explanation: For CUET PG Computer Science (2025), Binary Search (A) matches with the recurrence relation T(n) = T(n/2) + c (or O(1) for work) , reflecting its halving of search space, while Merge Sort (B) pairs with T(n) = 2T(n/2) + Θ(n) (or O(n)), as it splits the problem, solves recursively, then merges in linear time. The key is knowing Binary Search reduces problem size by half, and Merge Sort splits into two halves and merges. Here's the complete common matching: (A) Binary Search: T(n) = T(n/2) + c (or O(1)) (B) Merge Sort: T(n) = 2T(n/2) + Θ(n) (or O(n)) (C) Quick Sort (Worst Case): T(n) = T(n-1) + Θ(n) (or O(n))) (D) Linear Search: T(n) = T(n-1) + c (or O(1))

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.

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 2025 — Computer PYQ

CUET PG | Computer | 2025

Match List-I with List-II

List-1		List-II
(Algorithm)		(Recurrence relation)
(A)	Binary Search	(I)	$< b r > T (n) = T (\frac{n}{2}) + c (where c is a constant) < b r >$
(B)	Merge Sort	(II)	$< b r > T (n) = 2 T (\frac{n}{2}) + O (n) < b r >$
(C)	Quick sort (worst case partitioning	(III)	$< b r > T (n) = T (n - 1) + O (n) < b r >$
(D)	Linear Search	(IV)	$< b r > T (n) = T (n - 1) + c (where c is a constant) < b r >$

Choose the correct answer from the options given below:

Choose the correct answer: