Computer Science · Algorithms and Data Structures
In a binary search, the list is sorted in ascending order and the search key is present in the list. If the middle element is less than the search key, it means that:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The key is in the first half of the list
- 2The key is in the second half of the list✓
- 3The key is not present in the list
- 4The key is exactly at the middle position
Correct answer
The key is in the second half of the list
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 Algorithms and Data Structures MCQs →Want more practice questions on Algorithms and Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms and Data Structures