Question 1

How does a binary search work?

Accepted Answer

It splits data in two at the middle point, discarding the half that doesn't contain the search item

Answer

It searches through each item one at a time

Answer

It looks for true or false values in a list

Answer

It splits data into two separate setsand searches them one at a time

Question 2

How does a linear search work?

Accepted Answer

It starts at the first item and compares each item in turn with the search item

Answer

It splits data in two at the middle point, discarding the half that doesn't contain the search item

Answer

It stars the end last item and works backwards, comparing each item in turn

Answer

It splits data into two separate  sets and searches them one at a time

Question 3

Where does a linear search start?

Accepted Answer

At the start of a data set

Answer

At the end of a data set

Answer

In the middle of a data set

Answer

The item before the end of a data set

Question 4

Where does a binary search start?

Accepted Answer

In the middle of a data set

Answer

At the end of a data set

Answer

The item before the end of a data set

Answer

At the start of a data set

Question 5

How can you work out the maximum times a binary search can loop?

Accepted Answer

By working out how many times the total number of items in the data set can be reasonably halved, and then adding one

Answer

By working out how many times the total number of items in the data set can be reasonably halved, then subtracting one

Answer

It is impossible to work out, it depends where the item is in the list

Answer

By multiplying the max number of items by 0.5

Question 6

What is the formula for the maximum number of times a linear search can loop?

Accepted Answer

Max number of loops = data set length

Answer

It will keep looping infinitely

Answer

Max number of loops = data set length + 1

Answer

Max number of loops = data set length - 1

Question 7

What algorithm does this pseudocode represent?

Accepted Answer

Binary search

Answer

Liner sort

Answer

Linear search

Answer

Binary sort

Question 8

What algorithm does this pseudocode represent?

Accepted Answer

Linear search

Answer

Binary sort

Answer

Binary search

Answer

Linear sort

Question 9

Why must a data set be sorted in order to do a binary algorithm?

Accepted Answer

Because it needs to be able to look for the middle point of the data set

Answer

Because it compares each item one at a time

Answer

Because it is easier to program this

Answer

So that you can used mixed data types

Question 10

Why are linear algorithms better for smaller data sets?

Accepted Answer

Because binary algorithms are slower and inefficient for smaller data sets

Answer

Because comparing each item one by one is faster

Answer

Because linear algorithms split the list in half

Answer

Because linear algorithms can find items at the end of the set quicket

Question 11

What does line 7 in this pseudocode do?

Accepted Answer

Instructs the while loop to keep going until either the search item is found or the end of the data set is reached

Answer

Instructs the while loops to end only if the item is found

Answer

Instructs the while loop to keep going even if the end of the data set is reached

Answer

Instructs the while loop to end after a certain number of iterations

Question 12

What does line 5 in this pseudocode do?

Accepted Answer

Finds the middle point of the data set

Answer

Find the start and end of the data set

Answer

Finds the start of the data set

Answer

Finds the end of the data set

Related quizzes

Related quizzes