Match the specialized search problem in List I with its optimal Time Complexity in List II: List I (Problem) A. Find peak element in a 1D array B. Search in a row-col sorted matrix C. Find boundary positions in a sorted array D. Median of two sorted arrays of sizes and ( ) List II (Optimal Complexity)

A-2, B-3, C-4, D-1 Explanation: A. Find peak element in a 1D array: A peak element can be found in O (lo gN ) time using a modified Binary Search (checking the middle element and moving towards the larger neighbor). Matches with 2 (or 4). B. Search in a row-col sorted N × N matrix: Using the Staircase Search algorithm (starting from top-right or bottom-left corner), we eliminate either a row or a column in each step. Total steps required is at most 2 N , leading to an optimal time complexity of O ( N ) , which matches with 3 . C. Find boundary positions in a sorted array: Finding the first and last occurrence (boundary positions) of an element in a sorted array uses standard Binary Search. The optimal time complexity is O (lo gN ) , which matches with 4 (or 2). D. Median of two sorted arrays of sizes m and n (m≤n): Using

How do I solve CUET PG 2026 DSA questions?

Practice CUET PG 2026 DSA 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 DSA questions?

CUET PG DSA 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 2026 — DSA PYQ

CUET PG | DSA | 2026

Match the specialized search problem in List I with its optimal Time Complexity in List II:

List I (Problem)

A. Find peak element in a 1D array
B. Search in a row-col sorted $N \times N$ matrix
C. Find boundary positions in a sorted array
D. Median of two sorted arrays of sizes $m$ and $n$ ( $m \leq n$ )

List II (Optimal Complexity)

$O (lo g (min (m, n)))$

$O (lo g N)$

$O (N)$

$O (lo g N)$

Choose the correct answer: