What is the time complexity of Exponential Search to find a target value located at index k in an infinite or unbounded sorted array?

Explanation: Correct Answer: (B) Exponential Search works in two steps to find a target element located at index : Finding the range: The algorithm starts with an index of size 1 and doubles it ( ) until the current element is greater than or equal to the target. Since the index doubles at each step, finding a range that contains index takes steps. Binary Search within the range: Once the range is found (where ), Binary Search is performed on a subarray of size at most . Performing Binary Search on a subarray of size takes time. Total Time Complexity:

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 — What is the time complexity of Exponential Search to find a targe… | Mathem Solvex

+91 99359 65550 contact@maarula.in

Mathem SolvexGet the solution of every question

Login

Preparing for Excellence...

CUET PG 2026 DSA PYQ — What is the time complexity of Exponential Search to find a targe… | Mathem Solvex | Mathem Solvex

CUET PG 2026 — DSA PYQ

Choose the correct answer:

Explanation

Explanation