Daily Practice · GCSE Computer Science

Daily Practice - GCSE Computer Science

Systems, data representation, networks, algorithms and programming.

6th March 2025

5 questions · GCSE · 123 questions in this band

1
Algorithms
An array contains [9, 2, 6], to be sorted using insertion sort. Show the state of the array after each new element has been inserted into its correct position.
2
Translators and Integrated Development Environments (IDEs)
Explain the purpose of a breakpoint.
3
1D and 2D Array Processing: Writing and Tracing Programs
Trace this algorithm with data = [4, 9, 2, 9, 7] and state the final output. total = 0; count = 0; for i = 0 to 4: if data[i] > 5 then total = total + data[i] and count = count + 1; next i; print(total, count).
4
Programming Fundamentals
Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.
5
Producing Robust Programs
Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.

You are looking at an earlier sheet. Today's sheet is the one that adds a day.

Your run is kept in this browser only, and there is no account.

Every sheet is deterministic: the same date always regenerates the same five questions. All of March 2025, including the monthly compilation PDF.