Daily Practice · GCSE Computer Science

Daily Practice - GCSE Computer Science

Systems, data representation, networks, algorithms and programming.

18th August 2022

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)
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
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 August 2022, including the monthly compilation PDF.