Home Rankers PYQ Blogs Pricing About Contact
Home > PYQ Blogs > CUET-MCA 2021 Paper > Question 81

Question 81

Computer Awareness Searching Medium

The complexity of binary search algorithm is

(A) \( O(n) \)
(B) \( O( \log n) \)
(C) \( O\left(n^2\right) \)
(D) \( O(n \log n) \)
✓ Correct Answer: Option B Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

The binary search algorithm works by repeatedly dividing the search range by half. This leads to a logarithmic time complexity, specifically ( O(\log n) ). \[\] Correct Option: (b)

← Previous Question Our Rankers Next Question →

Practice Similar Searching Questions

Reinforce your conceptual grasp with related questions from CUET-MCA 2021:

Q55 What is the worst-case time complexity of linear search algorithm?
Solve →
Q68 Which of the following is not an application of binary search?
Solve →
Q34 Which of the following commands is used to delete a table in SQL?
Solve →
Q35 Which of the following standard algorithms is not a greedy algorithm?
Solve →
Q36 The waterfall model of software development is
Solve →
Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →