Daily Practice · GCSE Computer Science

Daily Practice - GCSE Computer Science

Systems, data representation, networks, algorithms and programming.

2nd November 2022

5 questions · GCSE · 123 questions in this band

1
Algorithms
Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
2
Translators and Integrated Development Environments (IDEs)
Describe what syntax highlighting is and how it helps a programmer.
3
1D and 2D Array Processing: Writing and Tracing Programs
An array named temps holds 12 values. State the index of the first item and the index of the last item.
4
Programming Fundamentals
State the most appropriate data type for storing a person's shoe size if only whole sizes (e.g. 7, 8, 9) are allowed.
5
Producing Robust Programs
A password field requires between 6 and 12 characters. State two boundary data values that should be used to test this field.

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