Binary search​

In which of the following cases, binary search algorithm is used?​

• To search an element in an unordered list.​

• To search an element in a list of few elements.

• To search an element in any ordered list with large number of elements.​

How does a binary search algorithm works?​

• Dividing the list into halves until the item is matched with one in the list.​

• Starts with the first element and checks the next element consecutively until a match is found.

• ​ None of the above​

An array with 32 elements is input to a binary search algorithm. How many maximum number of comparisons are performed?​

• 32

• 16

• 8

• 5

An array with 32 elements is input to a linear search algorithm. How many maximum number of comparisons are performed?​

• 32

• 16

• 8

• 5

How is the midpoint of the list calculated?​

• midpoint= round ((first_element+last_element)/2)​

• midpoint=(lower_bound+upper_bound)/2​

• midpoint= round ((lower_bound+upper_bound)/2)​

• midpoint= round ((lower_bound+upper_bound))

Under which of the following conditions, binary search algorithm terminates?​

• Item_found=true​

• lower_bound <= upper_bound​

• lower_bound > upper_bound

• ​ A or C

Complete the sentence: The lower half of the list is discarded if the value at midpoint is …………………….. item searched.​

• less than​

• greater than​

• equal to

True or False: The upper half of the list is discarded if the value at midpoint is greater than item searched.​

• True

• ​False​

What is the disadvantage of binary search algorithm?​

• It takes longer time when compared to linear search algorithm​

• It works only on sorted lists​

• It is very complex to understand​