Daily Practice · GCSE Computer Science

Daily Practice - GCSE Computer Science

29th June 1997

5 questions · GCSE · 123 questions in this band

1
Network Protocols and Layers
Give two reasons why network communication is divided into layers.
2
Algorithms
Calculate the maximum number of comparisons required by a binary search on a sorted list of 512 items.
3
Translators and Integrated Development Environments (IDEs)
Describe what syntax highlighting is and how it helps a programmer.
4
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.
5
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.

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.

Any date always gives the same five questions, so a sheet can be set again or shared. All of June 1997, including the monthly compilation PDF.