Alerts Wishlist Cart

Searching Algorithms: Binary Search - Competitive Exam Level

Download Q&A
Q. If a sorted array has 16 elements, how many comparisons will binary search make in the worst case?
  • A. 4
  • B. 5
  • C. 16
  • D. 8
Q. If the target value is not present in a sorted array, what will binary search return?
  • A. The index of the closest value
  • B. The index of the first element
  • C. The index of the last element
  • D. -1 or a sentinel value
Showing 1 to 2 of 2 (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