This clear, visually engaging poster explains programming languages and levels of abstraction, from human‑friendly high‑level languages down to assembly, machine code, and microcode inside the CPU. Designed for GCSE and A Level Computer Science / IT students, it supports understanding of: High‑level vs low‑level languages Abstraction and its purpose How different languages relate to computer hardware Where scripting languages, compiled languages, and lower‑level languages fit The poster uses exam‑safe terminology, concise explanations, and clear visual structure, making it ideal for classroom walls, computer labs, or revision displays. Suitable for OCR, AQA, and Edexcel specifications.

What this resource is A clear visual reference poster covering logic gates for GCSE and A Level Computer Science. It summarises standard logic gate symbols, truth tables, and terminology using language appropriate for both levels of study. Who it’s aimed at Designed for GCSE and A Level Computer Science students, and for teachers supporting the teaching of Boolean logic, digital circuits, and logic gate behaviour across KS4 and KS5. What it includes One professionally formatted PDF poster Standard logic gate symbols (e.g. AND, OR, NOT, NAND, NOR, XOR) Corresponding truth tables Clear labels and terminology suitable for exam revision and classroom reference How to use it This resource can be: Displayed in the classroom as a visual aid Projected during lessons when introducing or revising logic gates Printed for student reference Used to support exam questions involving logic gates and Boolean reasoning Useful definitions included Input and output behaviour of common logic gates Truth table notation Terminology commonly used in GCSE and A Level exam questions Important information Content is suitable for both GCSE and A Level Computer Science Provided as a PDF to preserve layout and formatting across devices Intended as a reference and visual aid, not an assessment or worksheet

What this resource is A clear visual reference poster providing a high‑level overview of the Systems Development Life Cycle (SDLC) for GCSE and A Level Computer Science. It summarises each stage of the development process using concise, exam‑appropriate explanations. Who it’s aimed at Designed for GCSE and A Level Computer Science students, and for teachers supporting the teaching of system development concepts, project lifecycles, and software development theory. What it includes One professionally formatted PDF poster All major SDLC stages: Feasibility study, Analysis, Design, Implementation, Testing, Installation, Documentation, Evaluation & maintenance Key terminology commonly used in exam questions How to use it This resource can be: Displayed in the classroom as a visual aid Projected during lessons introducing system development Printed for student revision and reference Used to support answers explaining the purpose of each SDLC stage Useful definitions included User requirements and system specifications Testing types and test data Changeover strategies Maintenance types (corrective, adaptive, perfective) Important information Suitable for both GCSE and A Level Computer Science Written at a high‑level, making it appropriate for wall display and revision Provided as a PDF to preserve layout and formatting Intended as a reference and visual aid, not a worksheet or assessment

What this resource is A concise revision / reference sheet covering Big‑O time and space complexity for OCR A Level Computer Science (H446). It summarises common complexity classes, data structures, and algorithms using clear, exam‑appropriate language and examples. Who it’s aimed at Designed for A Level Computer Science students studying OCR H446, and for teachers looking for a clear reference to support teaching and revision. Suitable for independent study, classroom use, or last‑minute exam preparation. What it includes: One professionally formatted PDF Tables summarising time and space complexity for common data structures and algorithms Clear explanations of common Big‑O growth rates Exam‑focused notes highlighting worst‑case vs average‑case behaviour How to use it This resource can be: Used by students as a revision aid or quick reference Displayed or projected during lessons Printed for individual or class use Used to support answers to “explain why” Big‑O exam questions Useful definitions included Common Big‑O growth rates (e.g. constant, linear, linearithmic, quadratic) Key assumptions such as worst‑case complexity unless stated otherwise Clarification of typical causes (loops, recursion, divide‑and‑conquer) Important information All complexities are aligned with OCR A Level Computer Science (H446) expectations Insert and delete operations refer to arbitrary positions unless stated otherwise Provided as a PDF to preserve layout and formatting across devices