Search and sort algorithms

Bearbeitungszugriff anfordern

Die Datei kann in Ihrem Browser nicht geöffnet werden, weil JavaScript nicht aktiviert ist. Aktivieren Sie JavaScript und laden Sie die Seite noch einmal.

In Google anmelden, um den Fortschritt zu speichern. Weitere Informationen

E-Mail-Adresse *

Name *

1. With a data set of 0, 1, 3, 5, 7, 8, 9 how many values would a binary search examine before it found the value 8? *

One

Two

Three

2. With a data set of 0, 1, 5, 4, 8, 9, 7 how many values would a linear search examine before it found the value 9? *

Five

Six

Seven

3. 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

4. How many passes will a bubble sort go through? *

Only one pass

Two passes

Several passes - until the data is fully ordered

5. Why does a bubble sort do a final pass even when the data is in the correct order? *

It does not recognise that the data is in order until the final pass requires no changes

It needs to do this to put the data back in to a list

To save the data

6. Which of the following is an advantage of a bubble sort? *

It takes a very long time to run

It is very quick

It is a very small and simple computer program

7. Which search examines each data item in turn until a match is made or there are no more items to examine? *

Standard search

Linear search

Binary search

8. Which of the following is an advantage of a linear search? *

It works on both ordered and un-ordered data sets

It works on strings and integers

It is more efficient than a binary search

9. Which of the following is a disadvantage of a binary search? *

It only works on numbers

It is less efficient than a linear search

It only works on an ordered list

10. Which of these types of sort is the most efficient? *

Merge sort

Binary sort

Bubble sort

11. Which of these types of sort is the easiest to program? *

Bubble sort

Binary search

Merge sort

12. With a data set of 0,1, 3, 5, 7, 8, 9 how many values would a linear search examine before it found the value 5? *

Four

Five

Six

13. With a data set of 0, 1, 5, 3, 8, 9, 7 how many values would a linear search examine before it found the value 9? *

Six

Seven

Five

14. Using this set of data, 3 9 13 21 30 39 42 48 52 60 76 79 90, what is the mid-point? *

15. Which search algorithm is being used if the mid-point is being selected? *

Merge search

Binary search

Linear search

Senden

Alle Eingaben löschen

Geben Sie niemals Passwörter über Google Formulare weiter.

Dieser Inhalt wurde nicht von Google erstellt und wird von Google auch nicht unterstützt. Missbrauch melden - Nutzungsbedingungen - Datenschutzerklärung

Formulare