CUET PG 2021 — Computer PYQ

Q: How do I solve CUET PG 2021 Computer questions?

Practice CUET PG 2021 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.

Q: 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.

Q: 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.

Question

CUET PG 2021 — Computer PYQ

CUET PG | Computer | 2021

Which of the following is not an application of binary search?

Choose the correct answer:

Explanation

Solution & Logic

Binary Search sirf un data structures par kaam karta hai jo Sorted (Ordered) hote hain. Iska reason binary search ka kaam karne ka tarika hai:

Divide Strategy: Algorithm hamesha middle element ( $mid$ ) check karta hai.

$mid = \text{low} + \frac{\text{high} - \text{low}}{2}$
Comparison Logic: Agar target element $X$ , $mid$ se chhota hai ( $X < \text{arr}[mid]$ ), toh algorithm sirf left half mein search karta hai.
Unordered List ka Problem: Agar list unordered (unsorted) hai, toh hum ye guarantee nahi de sakte ki chhota element left side hi hoga ya bada element right side. Is wajah se binary search galat result dega ya fail ho jayega.