CCEA GCSE · 試験対策

Digital Technology 2650 試験対策

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 分更新日: 2026年9月3日

試験の概要

試験数
3
満点
330
制限時間
4時間
出題形式
12
試験時間配点問題数配点比率出題形式
Unit 1: Digital Technology Core1時間901330%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)1時間 30分120940%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)1時間 30分1201040%Multiple Choice & Logic Tables, Binary Arithmetic & Conversions, Dry Run Trace Tables, Algorithm Design & Completion, Extended Writing (QWC), Testing Specification & Cloze
評価段階
A*ABC*CDEFGU
電卓の規定

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

過去問と採点基準にもとづいて作成(2022–2025)。

理解度をチェックしませんか?

このノートの内容を試験形式で演習。AIが生成する無制限の問題で、即座に採点・解説を受けられます。

このトピックを演習

電卓プログラム

Base-N mode to check binary and hex conversions

目的: 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.

使う場面: 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.

手順
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.

試験での注意: 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

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

使う場面: For questions that chain two or more storage-capacity conversions together, such as terabytes to gigabytes then gigabytes to megabytes.

手順
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.

試験での注意: 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.

よくあるミス

  1. 1high影響する配点: 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.

    回避方法: 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. 2medium影響する配点: 2Data validation

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

    回避方法: 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. 3medium影響する配点: 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.

    回避方法: 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. 4medium影響する配点: 3Encryption

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

    回避方法: 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. 5medium影響する配点: 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.

    回避方法: 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. 6medium影響する配点: 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.

    回避方法: 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. 7high影響する配点: 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.

    回避方法: 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.

コツを高得点につなげよう

thinka は弱点を的確な演習に変え、即時採点と試験形式のフィードバックを提供します。より賢く、より短時間で。

本番形式の問題を解いて、AIが即座に採点とフィードバック。

無料で問題を解いてみる