Daily Practice · GCSE Computer Science

Daily Practice - GCSE Computer Science

Systems, data representation, networks, algorithms and programming.

← All tiers

5th June 2026

5 questions · GCSE · 123 questions in this band

  1. 1
    Algorithms

    An array contains [9, 2, 6], to be sorted using insertion sort. Show the state of the array after each new element has been inserted into its correct position.

  2. 2
    Translators and Integrated Development Environments (IDEs)

    Explain why an interpreter is often preferred while a program is being written.

  3. 3
    1D and 2D Array Processing: Writing and Tracing Programs

    Explain why a running maximum should be initialised to the first element of the array rather than to 0.

  4. 4
    Programming Fundamentals

    Write one line of pseudocode that converts the string stored in heightInput into a real number and stores it in a variable called height.

  5. 5
    Producing Robust Programs

    Explain why iterative testing, carried out throughout development, tends to make errors cheaper to fix than relying only on final testing.

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.

Recent GCSE Computer Science sheets

Every sheet is deterministic: the same date always regenerates the same five questions. All of June 2026, including the monthly compilation PDF.