Searching Algorithms Quiz

A searching algorithm does (a)  

• Search through a set of data

• Save a set of data

• Help to organise data

Answer explanation

A searching algorithm does search through a set of data, helping to find specific information within the dataset.

What would be needed if searching algorithms didn't exist?

• The data would need to be saved

• Each item of data would need to be looked at one by one, until the searched for data was found

• A new set of data to look at would be needed

Answer explanation

Each item of data would need to be looked at one by one, until the searched for data was found

Which of these is a type of searching algorithm?

• Serial search

• Word search

• Search engine

Answer explanation

The correct choice is Serial search, as it is a type of searching algorithm.

Identify the search algorithm.

• Random search

• Binary search

• Denary search

• Next Item search

Answer explanation

Binary search is the correct search algorithm that needs to be identified from the given options.

What does a binary search do?

• Looks at the first item of data, then each one in turn, until it finds the data item requested

• Converts all the data into binary

• Takes the data and splits it in half repeatedly until it finds the data item requested

Answer explanation

Takes the data and splits it in half repeatedly until it finds the data item requested

Which search algorithm would be best to use with ordered data?

• A binary search

• Either binary search or a serial search

• A serial search

Answer explanation

A binary search is the best algorithm to use with ordered data because it has a time complexity of O(log n) compared to a serial search which has a time complexity of O(n).

What is an advantage of a binary search?

• It is very quick

• It only works with ordered lists

• It is a simple algorithm

Answer explanation

The advantage of a binary search is that it is very quick, making it efficient for finding elements in large datasets.

What is the biggest disadvantage of a binary search?

• It is slow

• It can only be used if the data is sorted into an order

• It takes the data and keeps dividing it in half until it finds the item it is looking for

Answer explanation

It can only be used if the data is sorted into an order

What does a sorting algorithm do?

• Finds an item of data in a set of data

• Saves a set of data

• Puts a list of items into order

Answer explanation

A sorting algorithm puts a list of items into order, arranging them based on a specified criteria or rule.

What does a bubble sort do?

• Sorts a list by comparing two items that are side by side, to see which is out of order

• Separates a list of data into different collections of data, before sorting and gathering back into a list

• Finds an item of data in a list

Answer explanation

Sorts a list by comparing two items that are side by side, to see which is out of order