Search Algorithms Quiz

What is a linear search?

• A method that checks every element in order

• A method that divides the list in half repeatedly

• A method that skips elements randomly

• A method that sorts the data first

Which search is faster for large, sorted datasets?

• Linear Search

• Binary Search

• Both are equally fast

• Neither works for large datasets

What is required for a binary search to work?

• Unsorted data

• Data sorted in order

• Data in alphabetical order only

• No specific requirements

How does a binary search find an item?

• By checking each element in sequence

• By sorting the list first

• By guessing the location of the item

• By dividing the list into two parts repeatedly

When is a linear search most useful?

• When the dataset is very large and sorted

• When the dataset is small and unsorted

• When the dataset contains only numbers

• When the dataset is alphabetical

What is the time complexity of a binary search?

• O(n)

• O(log n)

• O(1)

• O(n²)

Which search algorithm is simpler to implement?

• Linear Search

• Binary Search

• Both are equally complex

• None of the above

What happens if you use binary search on unsorted data?

• It works fine

• It sorts the data automatically

• It skips elements randomly

• It may not find the correct answer

Why is binary search faster than linear search?

• It checks every element

• It eliminates half the data with each step

• It doesn’t use indexing

• It avoids sorted datasets

What is an algorithm?

• A random set of steps

• A structured sequence of steps to solve a problem

• A computer error

• A programming language