G10 CS Binary Search

In which of the following cases a 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

• None of the above

How does a binary 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.

• Dividing the total number of elements and sorting them

• 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

• 3

How is the midpoint of the list is calculated in Binary Search algorithm?

• 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))

• None of the choices

Under which of the following conditions a Binary Search algorithm terminates?

• (a) Item_found=true

• (b) lower_bound <= upper_bound

• (c) lower_bound > upper_bound

• a or c choices

• b or c choices

Complete the sentence:

The lower half of the list is discarded if the value at midpoint is …………………….. item searched in a Binary Search algorithm.

• less than

• greater than

• equal to

• not equal to

• none

In Binary Search algorithm, the upper half of the list is discarded if the value at midpoint is greater than item searched.

• TRUE

• FALSE

• None of them

Which of the following statement is executed when list[midpoint] < item in Binary Search Algorithm

• item_found=true

• lower_bound=midpoint+1

• upper_bound=midpoint-1

• None of the choices

Which of the following statement is executed when list[midpoint] > item in Binary Search Algorithm

• item_found=true

• lower_bound=midpoint+1

• upper_bound=midpoint-1

• None of the choices

What is the disadvantage of Binary Search algorithm?

• It takes longer time when compared to linear search algorithm

• It works only on a sorted list

• It is very complex to understand

• None of the above