Pearson Edexcel · GCSE · 1CP2
Computer Science — Keywords & Key Terms — Definitions Glossary (2026)
Pearson Edexcel GCSE (9–1) Computer Science (1CP2)
Topic-by-topic keywords, key terms and definitions for precise exam language—separate from our revision checklists (topic coverage) and formula sheets (equations).
Keywords & Key Terms — definitions
Examiner-style keywords and definitions organised by syllabus topic. Terms are tagged Essential (start here), Core (typical exam standard), and Advanced for harder distinctions — tick each row when you can recall it. Your progress is saved in this browser for this list.
Pearson Edexcel GCSE Computer Science (1CP2)
Pearson Edexcel GCSE Computer Science (1CP2)
Pearson Edexcel GCSE (9–1) Computer Science (1CP2)
Aligned to Pearson Edexcel 1CP2: Paper 1 (Principles of Computer Science — computational thinking, data, computers, networks, issues and impact) and Paper 2 (Application of Computational Thinking — on-screen programming in Python). Boolean logic and data representation are assessed across both papers.
Mark schemes: Pearson rewards linked reasoning — a technical term followed by an explicit consequence (e.g. 'cache is fast → reduces FDE wait time → increases throughput'). Calculation answers must show formula, substitution and unit. Examiner reports flag missing units on file-size answers and confusion between symmetric and asymmetric encryption.
Active recall: 0 / 30 terms ticked
| Recalled | Topic | Level | Keyword | Definition |
|---|---|---|---|---|
| Computational thinking & algorithms | Essential | Algorithm | A step-by-step set of instructions to solve a problem. | |
| Computational thinking & algorithms | Core | Decomposition | Breaking a problem into smaller, more manageable sub-problems. | |
| Computational thinking & algorithms | Core | Abstraction | Removing unnecessary detail to focus on what matters for the problem. | |
| Computational thinking & algorithms | Core | Pseudocode | Structured English-like notation for designing algorithms before coding. | |
| Computational thinking & algorithms | Core | Trace table | Records variable values step-by-step to test or debug an algorithm. | |
| Computational thinking & algorithms | Advanced | Big-O notation | Describes worst-case algorithm efficiency — O(n) linear, O(log n) logarithmic, O(n²) quadratic. | |
| Data representation | Essential | Bit / byte | A bit is 0 or 1; a byte is 8 bits. | |
| Data representation | Core | Binary / hexadecimal | Base 2 and base 16 — group 4 bits per hex digit to convert. | |
| Data representation | Core | Two's complement | Signed binary representation — flip all bits and add 1 to negate. | |
| Data representation | Core | ASCII / Unicode | Character encoding standards — Unicode supports far more characters using more bits per code point. | |
| Data representation | Advanced | Image file size | width × height × bit depth ÷ 8 (bytes). | |
| Data representation | Advanced | Sound file size | sample rate × bit depth × duration ÷ 8 (bytes). | |
| Computers — architecture & memory | Essential | CPU | Central Processing Unit — fetches, decodes and executes instructions. | |
| Computers — architecture & memory | Core | Fetch–execute cycle | PC supplies address to MAR; instruction loaded to MDR; decoded and executed; PC increments. | |
| Computers — architecture & memory | Core | RAM vs ROM | Volatile working memory vs non-volatile firmware/boot memory. | |
| Computers — architecture & memory | Core | Cache | Small, fast memory between CPU and RAM holding frequently used data. | |
| Computers — architecture & memory | Advanced | Von Neumann architecture | Single shared memory and bus for instructions and data. | |
| Networks & cyber security | Core | LAN / WAN | Local Area Network (single site) vs Wide Area Network (geographically dispersed). | |
| Networks & cyber security | Core | TCP/IP | Protocol suite governing reliable transport and routing across networks. | |
| Networks & cyber security | Core | IP address | Numeric identifier assigned to each device on a network. | |
| Networks & cyber security | Core | Symmetric encryption | Same key encrypts and decrypts — fast but key distribution is the weak point. | |
| Networks & cyber security | Advanced | Asymmetric encryption | Public key encrypts, private key decrypts — secures key exchange and digital signatures. | |
| Boolean logic | Essential | AND / OR / NOT | Core logic gates — used in truth tables, conditions and circuits. | |
| Boolean logic | Core | Truth table | Lists every input combination and the resulting output for a logic expression. | |
| Boolean logic | Core | Logic circuit | Diagram of gates implementing a Boolean expression. | |
| Boolean logic | Advanced | De Morgan's laws | NOT(A AND B) = NOT A OR NOT B; NOT(A OR B) = NOT A AND NOT B. | |
| Issues & impact | Core | GDPR | UK/EU data-protection law — lawful basis, consent, subject rights, breach reporting. | |
| Issues & impact | Core | Copyright | Legal protection of original creative works against unauthorised copying. | |
| Issues & impact | Core | Privacy | Right to control how personal data is collected, stored and shared. | |
| Issues & impact | Advanced | Computer Misuse Act 1990 | Criminalises unauthorised access, modification and impairment of computer systems. |
Pair this with our revision checklists, formula sheets hub and past paper finder.
Computer Science (1CP2) — Keywords & Key Terms FAQ
- What is on this Pearson Edexcel GCSE Computer Science keywords and key terms list?
- It is a topic-organised glossary of important computer science terms with short, exam-style definitions aligned to Pearson Edexcel GCSE (9–1) Computer Science (1CP2) (1CP2). It is designed for “define”, “state”, “outline” and “explain” questions where precise vocabulary earns marks.
- How should I use this Computer Science glossary alongside past papers?
- Tick terms when you can recall them without reading the answer, then check your wording against mark schemes. Pair vocabulary practice with past papers for GCSE Computer Science (1CP2) so you apply terms in context.
- Is this the same as a revision checklist or a formula sheet?
- No. Revision checklists help you track which syllabus topics you have covered and your confidence—separate pages on Tutopiya. Formula sheets summarise equations and quantitative relationships. This page is only a definitions and key-terms glossary for Computer Science.
- Can I download this Computer Science keywords and key terms list for free?
- Yes. After a quick free sign-up you can download a UTF-8 CSV (opens in Excel or Google Sheets) or open a print-friendly page and save as PDF. Browsing the list on the page is free.
- Is this Computer Science list aligned to the 1CP2 specification?
- Topic groupings and wording follow Pearson Edexcel GCSE (9–1) Computer Science (1CP2) for Pearson Edexcel GCSE. Always confirm final learning objectives and any regional options in your official specification and recent examiner reports for your exam session.
- Why focus on definitions instead of full notes?
- Mark schemes reward correct technical terms and clear links between ideas. A compact glossary lets you drill the exact language examiners expect for Computer Science at GCSE, separate from longer notes or topic trackers.