CCEA GCSE · Exam Tips

Digital Technology 2650 Exam Tips

GCSE Digital Technology splits into a compulsory core plus either the Multimedia or Programming route. Algorithm writing, SQL and clean binary working carry most of the marks.

3 min readUpdated: Sep 3, 2026

Exam at a Glance

Papers
3
Total Marks
330
Time Limit
4h
Question Types
12
PaperDurationMarksQuestionsWeightingQuestion Types
Unit 1: Digital Technology Core1h901330%Multiple Choice (1 Mark), True/False & Matching Tables, Short Answer & Definition, Spreadsheet Formula & Design, Extended Writing (QWC), Vocabulary Matching Grid
Unit 2: Digital Authoring Concepts (Multimedia route)1h 30min120940%Multiple Choice (1 Mark), Design & UI Matching, Relational Database Design & SQL, Extended Writing (QWC), HTML/Web Authoring Tasks, Testing Methodology
Unit 4: Digital Development Concepts (Programming route)1h 30min1201040%Multiple Choice & Logic Tables, Binary Arithmetic & Conversions, Dry Run Trace Tables, Algorithm Design & Completion, Extended Writing (QWC), Testing Specification & Cloze
Grade Scale
A*ABC*CDEFGU
Calculator Policy

None of the three externally examined papers, Unit 1, Unit 2 or Unit 4, states a calculator restriction, so the general CCEA and JCQ default applies: a calculator is permitted, provided it holds no stored or retrievable information, no databanks, saved formulae or text, and offers no symbolic algebra, translation or internet function. If your calculator has an exam mode, activate it rather than relying on a manual reset, which does not clear stored memory. In practice, binary and hexadecimal conversion questions are marked on the working shown, so a calculator that produces the right final figure without the method behind it still leaves marks on the table.

  • AO1: AO1: demonstrate knowledge and understanding of the concepts, characteristics, components and functions of digital technology (30%)
  • AO2: AO2: apply knowledge and understanding of digital technology to investigate and analyse problems and propose solutions (46%)
  • AO3: AO3: design, develop and evaluate solutions to solve problems, making reasoned judgements and presenting conclusions (24%)

Built from real past papers and marking schemes (2022–2025).

Tips & Strategies

Where the marks sit

GCSE Digital Technology 2650 is built from a compulsory core, Unit 1, worth 30 percent, plus one of two routes. Route A pairs Unit 2: Digital Authoring Concepts with a controlled assessment portfolio, Unit 3. Route B pairs Unit 4: Digital Development Concepts with a different portfolio, Unit 5. Whichever route you follow, Unit 2 or Unit 4 is worth 40 percent and the portfolio unit 30 percent. This page is built from the externally examined papers, Unit 1, Unit 2 and Unit 4, so focus on whichever of Unit 2 or Unit 4 is actually your route and treat the other as background only. Across recent papers, Programming Constructs carries the heaviest chapter weighting by a wide margin, with Database Applications and Development, Multimedia Authoring and Web Design, and Digital Data Representation next.

Paper by paper timing

Unit 1 is 90 marks in 60 minutes, about 40 seconds a mark, and covers thirteen questions mixing multiple choice, true or false and matching tables, short answers, a spreadsheet task, one 6 mark QWC question and a 10 mark vocabulary matching grid. Unit 2 and Unit 4 are each 120 marks in 90 minutes, about 45 seconds a mark. Unit 2 spends real time on relational database design, SQL and web authoring tasks; Unit 4 spends it on binary and hex arithmetic, dry run trace tables and algorithm design, the largest single question type on that paper at roughly seven marks a question.

The techniques that carry the most marks

Algorithm and pseudocode writing, SQL and database design, and structured tracing tasks make up the bulk of Unit 2 and Unit 4 between them, more than any other question type on either paper. Three habits fix most of the marks lost here. First, when a question asks you to trace an algorithm or complete a dry run table, fill in every row for every pass, do not jump to the final state. Second, in SQL, quote the exact field names asked for rather than writing \(\textit{SELECT *}\), and always include a WHERE clause on UPDATE and DELETE statements unless the question tells you not to. Third, in loop design for input validation, use a WHILE or DO WHILE loop that only ends once valid data is entered, not a fixed count FOR loop, since a FOR loop cannot repeat an unknown number of times.

Binary and hexadecimal conversion questions want the working shown, not just the final value. Group bits into nibbles for hex, show the carry when adding binary numbers, and show the place value column you are using for decimal conversion. An answer with the right final figure but no working can still lose the method marks if a later check flags an error.

CCEA conventions to know

The 6 mark QWC questions on all three papers are marked on a banded scheme: legible text, accurate spelling and grammar, and writing that suits the technical content, organised clearly and using specialist vocabulary where it fits. When a QWC question raises two concepts, phishing and denial of service is a recurring pairing, cover both fully rather than writing everything about one and a sentence about the other. A response that only develops one side is capped in the middle band regardless of length.

CCEA does not publish a separate glossary of command words for this subject. The verbs in the assessment objectives, demonstrate, apply, analyse, design, develop and evaluate, are the practical command words you will meet in questions, so read each command word as an instruction about how much development the answer needs, not just what topic to write about.

Exam day plan

Start each paper with the multiple choice and short recall questions to bank easy marks fast, then move to the structured and extended items. On Unit 4, do the binary and hex questions early and show every step, since these are graded on method as much as on the final answer. Save the last five minutes of Unit 2 and Unit 4 to check that every SQL statement has the field names and WHERE clause the question actually asked for.

Ready to test yourself?

Turn these notes into exam-style practice. Get unlimited AI questions on this topic with instant marking and explanations.

Practice This Topic

Calculator Programs

Base-N mode to check binary and hex conversions

Purpose: Check a binary, hex or decimal conversion you have already worked out by hand, since the mark scheme rewards the working rather than just a final figure.

When to use it: For binary, hexadecimal or decimal conversion questions, using a calculator's base-N mode only to verify a conversion you have already shown by hand.

Steps
After working out a binary, hex or decimal conversion by hand, some scientific calculators let you switch into a base-N mode to check the value you reached. Use this only as a check, since mark schemes reward the working, the repeated division and remainder, or the nibble grouping, not just a final figure.

Exam note: This is a live check performed on a value already worked out by hand during the exam. The calculator must hold no stored programs, formulae or conversion tables; a base-N mode built into the device is fine, a saved routine is not.

ANS key for chained storage-capacity conversions

Purpose: Carry an exact intermediate value through a chained storage-capacity conversion, such as terabytes to gigabytes to megabytes, without retyping a rounded figure.

When to use it: For questions that chain two or more storage-capacity conversions together, such as terabytes to gigabytes then gigabytes to megabytes.

Steps
When a question chains two conversions, terabytes to gigabytes then gigabytes to megabytes, use the ANS key to carry the exact intermediate value into the next step rather than re-typing a rounded figure you copied down.

Exam note: ANS only carries forward a value calculated live in that exam session. No conversion factor, formula or note may be stored in the calculator in advance.

Common Mistakes

  1. 1highMarks at stake: 3Database keys and relationships

    In relational database questions, candidates give a primary key value from one table when the question asks for the foreign key linking it to another table.

    How to avoid it: Before answering, identify which table the question is asking about. The foreign key sits in the table on the many side of the relationship and repeats the primary key value from the one side.
  2. 2mediumMarks at stake: 2Data validation

    Validation algorithm answers confuse a range check with a presence check, or state a boundary comparison without giving both limits.

    How to avoid it: Name the check precisely: a presence check confirms data was entered at all, a range check confirms it falls between two stated limits. State both the upper and lower limit when describing a range check.
  3. 3mediumMarks at stake: 4Sorting algorithms

    Bubble sort and insertion sort get described interchangeably, without distinguishing adjacent comparisons and swaps from building a sorted sublist by inserting one item at a time.

    How to avoid it: Learn the two mechanisms separately. Bubble sort compares neighbouring pairs and swaps them if out of order, repeating passes until no swap is needed. Insertion sort takes each item in turn and inserts it into its correct position in the already sorted part of the list.
  4. 4mediumMarks at stake: 3Encryption

    Encryption is defined vaguely as protecting data with a password rather than as converting plaintext into ciphertext using an algorithm and a key.

    How to avoid it: Use the precise definition every time: encryption converts readable plaintext into scrambled ciphertext using an algorithm and a key, so that the data is unreadable without the matching key to reverse the process.
  5. 5mediumMarks at stake: 3Loop constructs in algorithms

    Input validation algorithms use a fixed count FOR loop where the question needs a loop that repeats until valid data is entered.

    How to avoid it: A FOR loop only suits a known, fixed number of repetitions. Validation needs a WHILE or DO WHILE loop that keeps asking for input until a condition, such as the value being within range, is finally met.
  6. 6mediumMarks at stake: 2Array indexing in algorithms

    Array algorithms reference the wrong element because of zero-based versus one-based confusion, for example accessing traffic[2] when the third element is intended.

    How to avoid it: Write out the index positions on scrap paper before coding the loop. If an array has 5 elements and starts at index 0, the loop condition should stop before index 5, not at index 5.
  7. 7highMarks at stake: 6QWC extended response

    In 6 mark QWC questions that raise two concepts, such as phishing and denial of service, candidates fully explain one and give only a sentence on the other.

    How to avoid it: Split your answer space in two before you start writing and give both concepts roughly equal development. An answer that only covers one side is capped below the top band regardless of how detailed that one side is.

Turn these tips into top grades

thinka turns your weak spots into targeted practice, with instant marking and exam-style feedback. Study smarter, not longer.

Practice real exam questions with instant AI feedback and marking.

Start Practicing Free