© eRevision.uk and ZigZag Education 2024
Our site uses cookies. Some of the cookies we use are essential for parts of the site to operate and have already been set. You may delete and block all cookies from this site, but parts of the site will not work. To find out more about cookies on this website, see our Cookie Policy
Accept
This test is run by guest.
Note that your final mark will not be saved in the system.

Fundamentals of Algorithms MatchUp

Target Level
4-5
Running Total
0
0%
Attempt
1 of 3

Drag each of the top boxes to its matching pair. You must match all the pairs before clicking ‘Check’.

Searching algorithms
Linear search
Time efficiency
Decomposition
Trace Table
Pseudocode
Binary search
Algorithm
Merge Sort
Flow charts
Abstraction
Bubble Sort
The process of breaking a problem into sub-problems which form identifiable tasks.
The process of removing unnecessary details from a problem.
A paper-based method used to check that a sequence of steps will produce the correct answer.
A diagrammatical method, using standard symbols to demonstrate the process of problem-solving
Step-by-step processes used to find specific data items in data sets.
Method of searching for a data item in a data set by looking at each individual item in the data set
Method of searching for a data item by dividing a sorted data set.
Algorithm that repeatedly compares and swaps each pair of values in a list.
Algorithm which repeatedly divides a list in half, sorts each half and combines the two back into a single list.
A method of describing an algorithm using a structure that is close to a real programming language
A sequence of steps that can be followed to complete a task or solve a problem.
When two programs are available that can solve the same problem, this is a method evaluating which to choose.

This is your 1st attempt! You get 3 marks for each one you get right. Good luck!

Pass Mark
75%