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.

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.

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.

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.

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.

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.

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.

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 นาทีอัปเดตเมื่อ: 3 ก.ย. 2569

ภาพรวมข้อสอบ

จำนวนฉบับ

คะแนนเต็ม

330

เวลาสอบ

4ชม.

ประเภทคำถาม

ฉบับ	เวลา	คะแนน	จำนวนข้อ	น้ำหนักคะแนน	ประเภทคำถาม
Unit 1: Digital Technology Core	1ชม.	90	13	30%	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นาที	120	9	40%	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นาที	120	10	40%	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.

ข้อผิดพลาดที่พบบ่อย

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.
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.
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.
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.
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.
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.
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 ตรวจคำตอบและให้ฟีดแบ็กทันที

เริ่มทำข้อสอบฟรี