Alerts Wishlist Cart

Searching Algorithms: Binary Search - Typical Problems - Advanced Concepts

Download Q&A
Q. In a binary search, if the middle element is greater than the target, which half of the array is searched next?
  • A. Left half
  • B. Right half
  • C. Both halves
  • D. None
Q. In binary search, what is the formula to find the middle index?
  • A. (low + high) / 2
  • B. (low + high) / 2 + 1
  • C. (low + high) / 2 - 1
  • D. low + high
Q. What is the result of a binary search if the array is empty?
  • A. Returns 0
  • B. Returns -1
  • C. Returns null
  • D. Returns an error
Showing 1 to 3 of 3 (1 Pages)
Biology (School & UG)
Biology (School & UG)
Chemistry (School & UG)
Chemistry (School & UG)
Civil Engineering
Civil Engineering
Commerce & Accountancy
Commerce & Accountancy
Computer Science & IT
Computer Science & IT
Current Affairs & GK
Current Affairs & GK
Data Structures & Algorithms
Data Structures & Algorithms
eBooks
eBooks
Electrical & Electronics Engineering
Electrical & Electronics Engineering
English (School)
English (School)
General Aptitude
General Aptitude
General Knowledge
General Knowledge
General Knowledge & Current Affairs
General Knowledge & Current Affairs
Languages & Literature
Languages & Literature
Law & Legal Studies
Law & Legal Studies
Major Competitive Exams
Major Competitive Exams
Mathematics (School)
Mathematics (School)
Mechanical Engineering
Mechanical Engineering
Medical Science
Medical Science
Physics (School & Undergraduate)
Physics (School & Undergraduate)
Quantitative Aptitude & Reasoning
Quantitative Aptitude & Reasoning
Social Science (School)
Social Science (School)
Technical
Technical
Verbal and Reasoning
Verbal and Reasoning
Vocational & Skill Development
Vocational & Skill Development
Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely