GCSE Computer Science, Programming. Usually met in years 9 to 11.
Learn computational thinking and the standard searching and sorting algorithms, and trace them on real lists.
What you practise
Decomposition and abstraction
Linear and binary search
Bubble, merge and insertion sort
Starts with key words and linear search and builds to tracing a bubble sort pass. Practice moves up a level when a round goes well and down when it does not.
Sample questions
Each sample comes with the method and the reason every wrong option is wrong. Real practice rounds are ten questions at your level.
Sample question, level 2 of 5
Which term means: going through a list comparing neighbouring items and swapping them if they are in the wrong order, until no swaps are needed?
Decomposition
Iteration
Insertion sort
Selection
Bubble sort
Show the answer and method
Answer: E, Bubble sort
The method: Bubble sort means going through a list comparing neighbouring items and swapping them if they are in the wrong order, until no swaps are needed.
Why the other options are wrong:
A, Decomposition: Decomposition means breaking a problem down into smaller problems that are easier to solve.
B, Iteration: Iteration means repeating a set of instructions, as in a loop.
C, Insertion sort: Insertion sort means taking each item in turn and putting it in its correct place among the items already sorted.
D, Selection: Selection means choosing which instructions to run depending on a condition, as in IF.
Sample question, level 4 of 5
Which term means: going through a list comparing neighbouring items and swapping them if they are in the wrong order, until no swaps are needed?
Abstraction
Decomposition
Iteration
Merge sort
Bubble sort
Show the answer and method
Answer: E, Bubble sort
The method: Bubble sort means going through a list comparing neighbouring items and swapping them if they are in the wrong order, until no swaps are needed.
Why the other options are wrong:
A, Abstraction: Abstraction means removing unnecessary detail so you can focus on what matters.
B, Decomposition: Decomposition means breaking a problem down into smaller problems that are easier to solve.
C, Iteration: Iteration means repeating a set of instructions, as in a loop.
D, Merge sort: Merge sort means splitting a list into single items, then merging them back together in order.
