Paper 1 · Theory Fundamentals
75 marks · 1 hour 30 minutes. AS topics 1–8. Practise precise definitions, number conversions, diagrams and applied explanations.
Concept-focused revision notes for Cambridge 9618. Start with the AS foundation, then study the advanced A Level topics. Use the explanations to understand why systems work, and practise applying ideas to unfamiliar scenarios.
Understand how computers represent numbers, text, images and sound, and why compression changes file size.
Binary is base 2, denary is base 10 and hexadecimal is base 16. Each hexadecimal digit represents four binary bits, making long binary values easier to read. Practise conversions in both directions and show each step.
Unsigned n-bit values range from 0 to 2ⁿ−1. Two’s complement uses the most significant bit as a negative place value; an n-bit signed value ranges from −2ⁿ⁻¹ to 2ⁿ⁻¹−1. Overflow occurs when a result cannot fit in the available bits.
ASCII represents a limited character set; Unicode supports a much wider range of writing systems and symbols. A character is stored as a numeric code, encoded into binary.
Bitmap images store pixels and colour values. Approximate uncompressed size = width × height × colour depth. Digital sound samples amplitude at regular intervals; sample rate and sample resolution affect quality and size.
Lossless compression reconstructs the original data exactly and is useful for text/program files. Lossy compression removes some information to reduce size, often for photos or audio. Choose based on quality and purpose.
Explain how networks move data and how devices identify and communicate with one another.
A LAN covers a limited area; a WAN spans larger distances. Routers forward packets between networks, switches connect devices within a LAN, and wireless access points provide Wi-Fi connectivity.
Protocols define communication rules. Data may be split into packets containing addressing and control information; packets can travel by different routes and are reassembled at the destination.
IP addresses identify network interfaces. DNS maps domain names to IP addresses. HTTP/HTTPS support web communication; HTTPS adds protection through encryption and authentication.
Serial transmission sends bits one after another; parallel transmission sends multiple bits simultaneously. Duplex describes whether communication is one-way, alternating two-way, or simultaneous two-way.
Understand the roles of computer components and how logic circuits produce outputs.
The CPU processes instructions; RAM holds currently used programs and data; secondary storage retains data without power. Input, output and communication devices connect the computer to its environment.
AND is true only when all inputs are true; OR is true when at least one input is true; NOT reverses a value. NAND, NOR and XOR are also important. Build truth tables systematically for every input combination.
A circuit combines gates to implement a Boolean function. Evaluate from input to output, one gate at a time. For n binary inputs, a complete truth table has 2ⁿ rows.
Follow how the processor fetches, decodes and executes instructions.
The control unit coordinates operations, the ALU performs arithmetic and logic, registers hold immediate values, and buses transfer data, addresses and control signals.
The program counter holds the address of the next instruction. The address is copied to the memory address register; the instruction is fetched into the memory data register and then the current instruction register, decoded and executed. Exact register transfers depend on the architecture described in the question.
Assembly mnemonics represent low-level operations. Bitwise shifts move bits left or right; masks use AND, OR or XOR to inspect or change selected bits. Track lost bits and overflow when shifting.
Compare operating-system responsibilities and the ways source code is translated.
An OS manages processes, memory, files, devices, user accounts and interfaces. Scheduling allocates processor time; memory management allocates and protects memory; device drivers help the OS communicate with hardware.
An assembler translates assembly language; a compiler translates a source program into another form before execution; an interpreter translates and executes source statements during execution. A linker combines modules and libraries; a loader places a program into memory.
Compiled programs can run efficiently after translation, but a change generally requires recompilation. Interpretation can support interactive execution and easier debugging, but repeated translation may add overhead.
Distinguish protecting data from keeping data accurate and complete.
Security controls prevent unauthorised access, alteration, disclosure or destruction. Controls include authentication, access rights, encryption, backups, firewalls, updates and physical security.
Encryption transforms readable plaintext into ciphertext using an algorithm and key. Authentication checks identity; authorisation determines permitted actions. They are related but not interchangeable.
Integrity means data remains accurate and consistent. Validation checks whether data meets rules; verification checks whether data was copied or entered correctly. Backups support recovery but do not by themselves prevent every integrity error.
Evaluate computing decisions in terms of rights, responsibilities and impacts.
Copyright protects original expression; licences specify permitted use; patents can protect qualifying inventions. Plagiarism presents someone else’s work as your own. Open-source software has licence conditions too.
Consider consent, data minimisation, fairness, accessibility, surveillance, environmental impact, job changes and unequal access. Strong answers explain a benefit, a risk and the context in which each matters.
Understand relational database structure and how DBMS software manages data.
Tables contain records and fields. A primary key uniquely identifies a row; a foreign key links related tables. Appropriate data types and constraints help maintain consistency.
A DBMS controls storage, queries, concurrent access, security and integrity. DDL defines structures, for example CREATE TABLE; DML manipulates data, for example SELECT, INSERT, UPDATE and DELETE.
Use conditions to select records, joins to combine related tables and aggregation to summarise values. Normalisation reduces unnecessary duplication and update anomalies; avoid storing the same fact repeatedly when a relationship can represent it.
Turn a problem into a clear, testable sequence of steps.
Decomposition breaks a problem into manageable parts; abstraction focuses on relevant details; pattern recognition identifies similarities; algorithmic thinking creates an ordered solution.
Sequence runs steps in order, selection chooses a path, and iteration repeats steps. Use pseudocode and trace tables to communicate and test logic. State assumptions clearly.
Normal data is typical, boundary data tests limits, and erroneous data should be rejected. Dry-run algorithms carefully, tracking each variable after every statement.
Select data types and structures that match the problem and operations.
INTEGER, REAL, CHAR, STRING and BOOLEAN represent different kinds of values. A record groups fields of potentially different types into one logical item.
An array stores multiple elements under one name, typically accessed by an index. Check index bounds and whether the algorithm uses zero-based or one-based indexing.
Files retain data between program runs. An abstract data type is described by the values and operations it supports, independent of the implementation. Stacks use last-in, first-out; queues use first-in, first-out.
Write structured pseudocode using variables, control structures, arrays and subprograms.
Use meaningful identifiers, suitable types, constants where values should not change, and clear input/output. Trace the actual value and type of each expression.
IF/ELSE and CASE select paths. FOR is useful when repetitions are known; WHILE checks a condition before each iteration; REPEAT…UNTIL checks after the loop body.
Procedures perform tasks; functions return values. Parameters pass information. Local variables are limited to a subprogram, while global variables have wider scope and can make programs harder to reason about.
Break a solution into small subprograms with clear purposes. Avoid duplicated logic, test each component and document assumptions.
Plan, design, test and maintain software in a systematic way.
Typical stages include analysis, design, implementation, testing, installation and maintenance. Iterative approaches repeat stages as requirements evolve.
Structure charts show how a system is decomposed into modules. Flowcharts and pseudocode describe control flow. Designs should be understandable, modular and testable.
Use normal, boundary and erroneous test data; compare actual with expected results. Corrective maintenance fixes faults, adaptive maintenance responds to environmental change, and perfective maintenance improves features or performance.
Study more advanced representations and efficient file access.
Enumerated types restrict a variable to a named set of values; pointer/reference concepts allow structures to refer to other data. Use the precise type rules specified by the question.
Serial files are processed in order; sequential files are ordered by a key; direct/random access can locate records without reading every preceding record. Indexes can speed retrieval but require storage and maintenance.
A floating-point value stores a sign, mantissa/significand and exponent. Precision and range depend on the bit allocation. Rounding and normalisation can create representation errors; show workings for conversions and calculations.
Compare protocols and switching methods in real network scenarios.
Protocols specify message formats and behaviour. Layering separates responsibilities so systems can interoperate. Use the syllabus terms for each protocol and explain what it contributes.
Circuit switching establishes a dedicated path for the duration of a session. Packet switching divides data into packets that may share network links and follow different routes. Compare setup, resource use, delay and resilience in context.
Encryption protects confidentiality; authentication helps verify parties or messages. Explain what is protected and what threats remain, rather than claiming one control solves every risk.
Understand processor performance, parallelism, virtualisation and Boolean algebra.
Performance depends on architecture, clock rate, cores, cache, memory and workload. Parallel processing can speed suitable tasks, but coordination overhead and tasks that cannot be parallelised limit gains.
A hypervisor allocates physical resources to virtual machines, each of which can run an operating system. Benefits include isolation and consolidation; costs can include overhead and resource contention.
Use Boolean identities to simplify expressions and circuits. De Morgan’s laws: NOT(A AND B) = NOT A OR NOT B; NOT(A OR B) = NOT A AND NOT B. Verify simplifications with truth tables when unsure.
Compare operating-system purposes and advanced translation tools.
The OS provides abstraction, resource management, security and user interaction. Scheduling, virtual memory, interrupt handling and device management help share hardware among processes.
Compiler stages may include lexical analysis, syntax analysis, semantic analysis, optimisation and code generation. Assemblers, interpreters, linkers and loaders have distinct roles; explain the role relevant to the scenario.
Explain encryption systems, protocols and digital certificates.
Symmetric encryption uses the same secret key for encryption and decryption and is efficient for bulk data. Asymmetric cryptography uses a public/private key pair and can support key exchange or digital signatures, but has greater computational cost.
A digital signature can help verify origin and detect alteration; it does not automatically make a message confidential. A digital certificate binds an identity to a public key and is signed by a trusted certificate authority.
TLS can protect a connection using certificates and negotiated cryptographic keys. Certificate validity and trust chains matter; encryption alone does not prove that a website is honest.
Explain AI approaches, uses, limitations and ethical consequences.
Rule-based expert systems apply explicit rules to a knowledge base. Machine learning systems infer patterns from training data. Distinguish training, validation and testing data where relevant.
AI outputs depend on data, design and context. Biased or incomplete data can produce unfair results. Consider explainability, privacy, reliability, human oversight and the cost of incorrect decisions.
Analyse algorithms, efficiency and recursive solutions.
Evaluate correctness and efficiency. Big-O notation describes how resource requirements grow as input size increases; it is not a precise timing prediction for one machine.
A recursive function calls itself on a smaller subproblem. It needs a base case and progress toward that case; otherwise it may recurse indefinitely or exhaust the call stack.
Trace recursive calls and returns carefully. Compare an iterative and recursive approach in terms of clarity, memory use, and suitability for the problem.
Apply programming paradigms and handle files and runtime errors.
Procedural programming organises instructions and procedures; object-oriented programming groups state and behaviour into objects; declarative programming describes what result is wanted rather than every step. Match the paradigm to the problem.
Open files in the appropriate mode, check for end-of-file or read failures, process records safely and close files. Validate external input and avoid assuming every record is well-formed.
Exceptions allow a program to respond to runtime problems. Handle expected failures at suitable points, provide meaningful recovery or messages, and avoid hiding errors that should be corrected.
75 marks · 1 hour 30 minutes. AS topics 1–8. Practise precise definitions, number conversions, diagrams and applied explanations.
75 marks · 2 hours. AS topics 9–12. Write pseudocode, trace variables, design algorithms and test normal, boundary and erroneous data.
75 marks · 1 hour 30 minutes. A Level topics 13–20. Explain advanced systems and apply them to scenarios; practise multi-step reasoning.
75 marks · 2 hours 30 minutes. Programming tasks covering algorithms, recursion, paradigms, file processing and exception handling. Practise in your chosen syllabus language.