Computer Science · Data Structures and Algorithms
Choose the true statement(s) regarding search algorithms: I - Binary search is asymptotically faster than linear search in the average and worst cases. II - Binary search cannot be applied to all input lists on which linear search can be applied (e.g., unsorted lists).
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Neither I nor II
- 2Both I and II✓
- 3Only II
- 4Only I
Correct answer
Both I and II
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms