Fundamentals

This topic explores fundamental concepts that shape our understanding of the world.

The fundamentals section covers the foundational concepts that underpin all of computer science: how data is represented in binary, how processors execute instructions, how operating systems manage resources, and the ethical framework within which computing operates.

• Binary, decimal, hexadecimal — conversion between all bases
• Binary arithmetic — addition, subtraction, shifts
• Two”s complement — representing negative integers; range $-2^{n-1}$ to $2^{n-1}-1$ for $n$ bits
• Binary-coded decimal (BCD) — when and why it is used

• IEEE 754 — sign, exponent, mantissa; normalisation
• Precision and rounding errors — why $0.1 + 0.2 \neq 0.3$ in binary
• Absolute and relative error — quantifying approximation quality

• Boolean operations — AND, OR, NOT, XOR, NAND, NOR
• Truth tables — evaluating Boolean expressions
• Simplification — De Morgan’s laws, Boolean algebra identities
• Logic gate circuits — designing circuits from Boolean expressions and vice versa
• Flip-flops and adders — combining gates into functional units

• Von Neumann architecture — CPU, memory, I/O, buses (address, data, control)
• Fetch-decode-execute cycle — how instructions are processed step by step
• Registers — PC, MAR, MDR, ACC, and their roles
• Instruction set — assembly language programming concepts

• Process management — scheduling algorithms (FCFS, SJF, Round Robin)
• Memory management — paging, segmentation, virtual memory
• File systems — directory structures, access methods

• Data protection — GDPR principles, data subject rights
• Computer Misuse Act — unauthorised access, malware
• Copyright and intellectual property — software licensing
• Privacy, surveillance, and AI ethics — contemporary issues

1. Practise base conversions until they are automatic. Binary $\leftrightarrow$ decimal $\leftrightarrow$ hexadecimal conversions appear on every paper.
2. Trace the fetch-decode-execute cycle with specific instructions and register values. This is a common long-answer question.
3. Build truth tables methodically. Always list all input combinations systematically to avoid missing rows.
4. Apply De Morgan’s laws by rewriting expressions. Exam questions test whether you can simplify, not just recognise.
5. Link legal content to real examples. E.g., link GDPR to a specific data breach case.

Work through in sidebar order. Each topic builds on the previous: number systems lead to floating-point, Boolean algebra leads to logic gates, and architecture ties everything together. Master the fundamentals before moving to data structures and algorithms.

This section provides comprehensive A-Level Computer Science content for Fundamentals, covering all specification points with detailed explanations, worked examples, and practice questions.

Each page in this section includes:

• Definitions: Clear, precise explanations of key concepts
• Worked Examples: Step-by-step solutions with annotations
• Practice Questions: Multiple-choice and structured questions with mark schemes
• Common Pitfalls: Errors to avoid and how to fix them
• Exam Tips: Strategies for maximising marks in this topic

1. Read the introductory page to understand the topic overview
2. Work through each sub-topic in order
3. Attempt the practice questions before checking solutions
4. Use the flashcards to revise key terminology
5. Complete the diagnostic test to identify remaining gaps

• Core definitions and principles
• Application to examination-style questions
• Links to related topics across the specification
• Assessment objective alignment (AO1, AO2, AO3)

• Active Recall: Test yourself regularly rather than re-reading notes
• Spaced Practice: Revisit this topic at increasing intervals
• Interleaving: Mix with other topics during revision sessions
• Elaboration: Explain concepts in your own words

Focus on command word interpretation and mark scheme analysis. Practice timing yourself on questions to build speed and accuracy. Review examiner reports for this topic to understand common student errors.

This landing page provides comprehensive coverage of Computer Science content for the Alevel qualification, with detailed explanations, worked examples, and practice questions aligned to the specification.

This page includes:

• Key Definitions: Precise explanations of essential concepts
• Core Concepts: Detailed treatment of fundamental principles
• Worked Examples: Step-by-step solutions demonstrating application
• Practice Questions: Examination-style questions with mark schemes
• Common Pitfalls: Frequent errors and how to avoid them
• Exam Tips: Strategies for maximising marks

1. Read through the introductory material to establish context
2. Study the definitions and core concepts carefully
3. Work through the worked examples, following each step
4. Attempt the practice questions independently
5. Review your answers against the provided solutions
6. Note any areas requiring further revision

• Foundational definitions and terminology
• Application of principles to examination contexts
• Connections to related topics within the specification
• Assessment objective alignment

• Active Recall: Test yourself on the material rather than passively re-reading
• Spaced Repetition: Review this content at increasing intervals
• Interleaving: Mix this topic with others during study sessions
• Elaborative Interrogation: Ask yourself why each concept works

Practise applying these concepts under timed conditions. Focus on understanding what each question is asking and how marks are allocated. Review examiner reports to learn from common mistakes made by other students.

• Computer Science
• Number Systems
• Floating Point Representation