Linear and Binary Search Quiz

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

• To search an element in an unordered list.

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

• Well suited for almost all types of list.

• To search an element in unordered list consisting of few elements.

What is the worst case scenario of searching array students?

• All the searches take the same time

• Item= Henry

• Item=Annabelle

• B or C

What is the best case scenario of searching array students?

• Item= Andrew

• Item= George

• Item=Annabelle

• All the searches take the same time

A linear search algorithm takes two inputs: one is a ordered list and another one is unsorted list. Which of the two will be searched faster?

• Sorted list

• Unsorted list

• Depends on the position of item to be searched

Under which of the following conditions is a linear search complete?

• Item is found

• Item is not present in the list

• A or B

How many times is the code inside while loop (position= position + 1) executed if item = 'G'?

• 1

• 2

• 3

• 4

What is the output if item = 'R'?

• item found at position 4

• item not found

• item found at position 3

• item found at position 5

How many times is the code inside while loop (position = position + 1) executed if item = 'K'?

• 5

• 6

• 7

• 8

Which of the following is TRUE about linear search algorithm?

• Linear search algorithm checks each element one by one.

• The worst case scenario of a linear search occurs if the item is not in the list.

• The worst case scenario of a linear search occurs if the item is the last element of the list.

• All of these

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.

• None of the above