Daily Practice · GCSE Computer Science

Daily Practice - GCSE Computer Science

22nd April 1996

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)
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
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.

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