Computer Science · Algorithms
Consider the following statements: Statement A: Binary search takes a sorted/ordered list and divides it in the middle. Statement B: If the middle element is greater than the key, the search repeats only in the second half of the list. Statement C: Hash-based searching calculates the position of the key in the list using a formula called the hash function and the key itself. Which of the following is correct?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement A is true, Statement B is false, Statement C is false
- 2Statement A is false, Statement B is false, Statement C is true
- 3Statement A is true, Statement B is true, Statement C is false
- 4Statement A is true, Statement B is false, Statement C is true✓
Correct answer
Statement A is true, Statement B is false, Statement C is true
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 MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms