Quiz - 7

What is a linear search?

• A search that compares each item one by one

• A search that splits the array into halves

• A search that uses a hash table

• A search that uses a binary tree

What is the main disadvantage of a linear search?

• It is very efficient

• It requires sorting the array

• It isn’t very efficient

• It uses a lot of memory

In a binary search, what must be true about the array?

• It must be unsorted

• It must be sorted

• It must be in reverse order

• It must be in random order

What is the first step in a binary search?

• Compare each item one by one

• Find the middle item

• Sort the array

• Find the largest item

What does a binary search do if the item is less than the middle item?

• Search the right half

• Search the left half

• Stop the search

• Search the entire array

What is a key feature of the binary search function?

• It is iterative

• It is recursive

• It is linear

• It is non-recursive

How many comparisons are needed in a binary search of 11 numbers?

• 11 comparisons

• 4 comparisons

• 17 comparisons

• 2 comparisons

How many comparisons are needed in a linear search of 11 numbers?

• 11 comparisons

• 4 comparisons

• 17 comparisons

• 2 comparisons

What is the maximum number of comparisons needed to search a dictionary of over 100,000 words using a binary search?

• 11 comparisons

• 4 comparisons

• 17 comparisons

• 100 comparisons

What is the output when the item is found in both linear and binary searches?

• "Item not found"

• "Search complete"

• "Item found"

• "End of search"