Have an account?
Skip to Content
Build your own quiz
Suggestions for you
9 questions
Show Answers
See Preview
- 1. Multiple Choice
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.
- 2. Multiple Choice
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
- 3. Multiple Choice
An array with 32 elements is input to a binary search algorithm. How many maximum number of comparisons are performed?
32
16
8
5
- 4. Multiple Choice
An array with 32 elements is input to a linear search algorithm. How many maximum number of comparisons are performed?
32
16
8
5
- 5. Multiple Choice
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))
- 6. Multiple Choice
Under which of the following conditions, binary search algorithm terminates?
Item_found=true
lower_bound <= upper_bound
lower_bound > upper_bound
A or C
- 7. Multiple Choice
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
- 8. Multiple Choice
True or False: The upper half of the list is discarded if the value at midpoint is greater than item searched.
True
False
- 9. Multiple Choice
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
- Answer choicesTagsAnswer choicesTags