Daily Practice · GCSE Computer Science

Daily Practice - GCSE Computer Science

Systems, data representation, networks, algorithms and programming.

9th June 2025

5 questions · GCSE · 123 questions in this band

1
Algorithms
An array called items contains [12, 45, 7, 30, 19] at indices 0 to 4. Describe how a linear search would locate the value 30, stating the number of comparisons needed.
2
Translators and Integrated Development Environments (IDEs)
Give one advantage and one disadvantage of using a compiler.
3
1D and 2D Array Processing: Writing and Tracing Programs
Describe what a nested loop does when it processes a 2D array.
4
Programming Fundamentals
A FOR loop runs: total = 0, FOR i = 1 TO 4, total = total + i, NEXT i. State the value of total after the loop finishes.
5
Producing Robust Programs
Give one example of erroneous test data for a field that only accepts whole numbers from 1 to 10.

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 June 2025, including the monthly compilation PDF.