AQA GCSE Computer Science (8525)

3.1: Fundamentals of Algorithms: revision quiz and key terms

Free practice for 3.1: Fundamentals of Algorithms in AQA GCSE Computer Science (8525). It has 4 parts: 3.1.1 Representing Algorithms, 3.1.2 Efficiency of Algorithms, 3.1.3 Searching Algorithms and 3.1.4 Sorting Algorithms. Try the questions, then check the key terms.

Try 5 free questions

No sign-in needed. Tap an answer to check it.

Question 1 · Multiple choice

In an algorithm, which stage involves manipulating or transforming data to produce a result?

Question 2 · True or false?

Binary search is generally more time-efficient than linear search on large, sorted lists.

Question 3 · Multiple choice

Which sorting algorithm repeatedly splits a list into halves until each sub-list has one item, then merges the sub-lists back together in order?

Question 4 · True or false?

Sorting algorithms locate a specific target value within a list, while searching algorithms rearrange data into order.

Question 5 · Multiple choice

Which method of representing an algorithm uses standard shapes, such as diamonds for decisions, connected by arrows?

In RADevo, this topic has fill-in-the-blank, matching, multiple-choice and true or false activities, and every question you get wrong comes back in Revise today until you've learnt it.

Key terms for 3.1: Fundamentals of Algorithms

Abstraction: Removing unnecessary detail from a problem to focus on what is important.
Algorithm: A sequence of steps that can be followed to complete a task.
Binary search: A search that repeatedly checks the middle item of a sorted list and discards the half that cannot contain the target.
Bubble sort: Repeatedly compares and swaps neighbouring items until the list is in order.
Decomposition: Breaking a problem down into a number of smaller sub-problems.
Divide and conquer: The general strategy used by merge sort of breaking a problem down before solving it.
Linear search: A search that checks each item in a list in turn until the target is found or the list ends.
Merge sort: A sort that splits a list into single items and then merges them back together in order.

What 3.1: Fundamentals of Algorithms covers

In RADevo this topic has a full topic test and a focused quiz for each part:

3.1.1 Representing Algorithms
3.1.2 Efficiency of Algorithms
3.1.3 Searching Algorithms
3.1.4 Sorting Algorithms

Teaching AQA GCSE Computer Science (8525)?

Set this topic as homework in two clicks, see who has done it and which questions your class got wrong, and start every lesson with a Do Now built from their mistakes.

Start a free 2-week trial

Revising for this?

If your school uses RADevo, sign in to do the full quizzes and keep your progress. If it doesn't, show this page to your Computing teacher.