Question 1

What is a searching algorithm?

Accepted Answer

A set of instructions for looking for a piece of data in a dataset

Answer

A built in method for searching through a list

Answer

A set of instructions for searching a program

Answer

A way of looking for items in a text file only

Question 2

Why do we need searching algorithms?

Accepted Answer

To allow programs to find data in a data structure or file

Answer

So we can sort out data out easily

Answer

To be able to save data sets

Answer

To order data in alphabetical order

Question 3

Which of these is true of a data set, in order to able to sort it using a linear search?

Accepted Answer

It must be stored in the same data structure or file

Answer

It must be in alphabetic order

Answer

It must be the same data type, such as integer or string

Answer

It must be in the data set in the first place

Question 4

Which of these is true  of a data set, in order to be able to sort is using a binary search?

Accepted Answer

It must be ordered either alphabetically or numerically

Answer

It must be of different data types

Answer

The item being searched for must be in the data set

Answer

It must only contain numerical data, such as integers or floats

Question 5

Why is a linear search the best to use on a smaller data set?

Accepted Answer

Binary searches take longer to execute

Answer

The search will start in the middle

Answer

The item will most likely be at the start of the list

Answer

If the item is not there, it will add it

Question 6

Why is a binary search more efficient for a larger sorted data set compared to a linear search?

Accepted Answer

The item might be right at the end of the list, a binary search would find it quicker

Answer

A linear search does not work on sorted data, it would return an error

Answer

A binary search is always quicker than a linear search

Answer

A linear search does not work as effectively on sorted data

Question 7

Why could you not do a binary search on a data of a mixed data type? E.g, Integers and Strings

Accepted Answer

Binary searches rely on data being sorted either numerically or alphabetically

Answer

Binary searches only work on strings

Answer

Binary searches only work on integers

Answer

Binary searches take too long to search

Question 8

What is one of the advantages of using a linear search over a binary search?

Accepted Answer

It requires less processing as it is a more simple algorithm

Answer

It can search non sorted data

Answer

It is faster for larger data sets

Answer

It is always quicker than a binary search

Question 9

What is one of the advantages of using a binary search over a linear search?

Accepted Answer

It is faster for larger data sets if they are sorted

Answer

It requires less processing as it is a more simple algorithm

Answer

It can search non sorted data

Answer

It is always quicker than a linear search

Question 10

What is one of the disadvantages of using a binary search over a linear search?

Accepted Answer

The data must be sorted first

Answer

It can only search integers

Answer

It can only search strings

Answer

It is always slower to search

Question 11

What is one of the disadvantages of using a linear search over a binary search?

Accepted Answer

It can be slower if the item is right at the end of the array

Answer

It can only search one data type

Answer

It is a complex algorithm compared to binary searching

Answer

If the item is not found it keeps looking

Question 12

If you have to search through a sorted array of 50 students names, which searching algorithm would be best to use?

Accepted Answer

Linear, as it is a small data set

Answer

Linear, as it is a set of strings

Answer

Binary, as it is a small data set

Answer

Linear, as they are best for sorted arrayd

Related quizzes

Related quizzes