This complete teaching and revision pack covers the full AQA A-Level Computer Science Paper 1 (7517/1) specification. Designed by an experienced CS teacher with over 20 years in the classroom, every resource in this pack has been used and refined with real students. The pack includes lesson notes, student worksheets, homework tasks and full model answers for every topic, so you have everything you need to teach, set work and assess without spending hours creating resources from scratch. Topics covered include the characteristics of contemporary processors, types of memory and storage, networking, the internet and communication, databases, Boolean algebra, data types and structures, legal and ethical issues, and more — all aligned to the current AQA 7517/1 specification. Suitable for use as a teaching resource throughout the year or as a focused revision tool in the run-up to exams. Works equally well for independent student revision. All resources are provided as PDF files, ready to use immediately. If you have any questions about the pack or need anything clarified, feel free to get in touch.

This complete teaching and revision pack covers the full AQA A-Level Computer Science Paper 2 (7517/2) specification. Designed by an experienced CS teacher with over 20 years in the classroom, every resource in this pack has been used and refined with real students. The pack includes lesson notes, student worksheets, homework tasks and full model answers for every topic, so you have everything you need to teach, set work and assess without spending hours creating resources from scratch. Topics covered include computational thinking, problem solving and programming, algorithms, data structures, theory of computation, regular languages, the Turing machine, Big O notation, classification of algorithms, and more — all aligned to the current AQA 7517/2 specification. Suitable for use as a teaching resource throughout the year or as a focused revision tool in the run-up to exams. Works equally well for independent student revision. All resources are provided as PDF files, ready to use immediately. If you have any questions about the pack or need anything clarified, feel free to get in touch.

This complete teaching and revision pack covers the full OCR A-Level Computer Science Component 1 (H446/01) specification. Designed by an experienced CS teacher with over 20 years in the classroom, every resource in this pack has been used and refined with real students. The pack includes lesson notes, student worksheets, homework tasks and full model answers for every topic, so you have everything you need to teach, set work and assess without spending hours creating resources from scratch. Topics covered include the characteristics of contemporary processors, types of memory and storage, networking, the internet and communication, databases, Boolean algebra, data types and structures, legal and ethical issues, and more — all aligned to the current H446/01 specification. Suitable for use as a teaching resource throughout the year or as a focused revision tool in the run-up to exams. Works equally well for independent student revision. All resources are provided as PDF files, ready to use immediately. If you have any questions about the pack or need anything clarified, feel free to get in touch.

This complete teaching and revision pack covers the full OCR A-Level Computer Science Component 2 (H446/02) specification. Designed by an experienced CS teacher with over 20 years in the classroom, every resource in this pack has been used and refined with real students. The pack includes lesson notes, student worksheets, homework tasks and full model answers for every topic, so you have everything you need to teach, set work and assess without spending hours creating resources from scratch. Topics covered include computational thinking, problem solving and programming, algorithms, data structures, theory of computation, regular languages, the Turing machine, Big O notation, classification of algorithms, and more — all aligned to the current H446/02 specification. Suitable for use as a teaching resource throughout the year or as a focused revision tool in the run-up to exams. Works equally well for independent student revision. All resources are provided as PDF files, ready to use immediately. If you have any questions about the pack or need anything clarified, feel free to get in touch.

Complete GCSE Computer Science teaching pack on Boolean Simplification. Includes lesson, worksheet, homework & full answers. AQA, OCR & Eduqas. Boolean simplification is one of the most challenging topics on the GCSE Computer Science specification, and finding clear, well-structured resources for it can be surprisingly difficult. This complete teaching pack takes the hard work out of your planning and gives your students everything they need to confidently tackle Boolean algebra questions in their exams. Created by an experienced Computer Science teacher and tutor with over 20 years in education, this pack is fully mapped to the AQA, OCR (J277), and Eduqas (2020) GCSE specifications. What is included in this pack? A 13-slide lesson presentation walks students through Boolean simplification from first principles — covering why we simplify circuits, all the key Boolean identities, and De Morgan’s Laws, with clear worked examples throughout. A student worksheet reinforces learning with a matching activity, short-answer theory questions, and multi-step simplification challenges pitched at exam level. A homework task features three exam-style questions including a real-world smart home scenario to consolidate understanding beyond the classroom. A complete teacher answer scheme provides full working-out for every question on both the worksheet and the homework, saving you significant marking time. Topics covered include: Identity, Annulment, Idempotent, Complement, Commutative, Associative, Distributive, and Absorption Laws, De Morgan’s Laws, and step-by-step simplification techniques. Who is this for? This resource is ideal for KS4 Computer Science teachers delivering the GCSE specification across AQA, OCR, or Eduqas exam boards. It is particularly well-suited to NQTs or non-specialist teachers who need a clear, confident structure for teaching this complex topic. Save hours of planning time and give your students the best possible preparation for their Boolean algebra exam questions.

Complete A-Level Computer Science teaching pack on Database Normalisation (1NF, 2NF, 3NF). Includes lesson, worksheet, homework & full answers. AQA & OCR. Database normalisation at A-Level requires a deep understanding of data structures, functional dependencies, and relational integrity. This complete teaching pack takes the confusion out of the normalisation process, providing a rigorous, step-by-step approach to converting unnormalised data into First, Second, and Third Normal Form. Created by an experienced Computer Science teacher and tutor with over 20 years in education, this pack is fully mapped to the AQA (7517) and OCR (H446) A-Level specifications. What is included in this pack? A 13-slide lesson presentation walks students through the fundamental problems of flat-file databases — including update, insertion, and deletion anomalies — before explaining the rules for 1NF, 2NF, and 3NF using clear, complex worked examples involving composite keys, partial dependencies, and transitive dependencies. A student worksheet reinforces learning with theory questions on database anomalies, key terminology matching, and a practical step-by-step normalisation challenge based on a veterinary clinic scenario. A homework task features two challenging exam-style questions requiring students to identify dependency violations and normalise complex multi-table structures to 3NF, including a library loans database and a company training records database. A complete teacher answer scheme provides full answers and step-by-step working-out for every question on both the worksheet and the homework. Topics covered include: Flat-file vs relational databases, update, insertion and deletion anomalies, primary, foreign and composite keys, First Normal Form (1NF), Second Normal Form (2NF) and partial dependencies, and Third Normal Form (3NF) and transitive dependencies. Who is this for? Ideal for KS5 Computer Science teachers delivering the A-Level specification across AQA or OCR. Particularly well-suited to those who need a clear, structured approach to teaching this abstract and challenging topic. Save hours of planning time and give your students the best possible preparation for their A-Level database exam questions.

Complete A-Level Computer Science teaching pack on Boolean Algebra & Karnaugh Maps. Includes lesson, worksheet, homework & full answers. AQA & OCR. Advanced Boolean algebra, De Morgan’s Laws, and Karnaugh Maps are often the most mathematically demanding topics on the A-Level Computer Science specification. This complete teaching pack provides a rigorous, step-by-step approach to teaching these concepts, moving students from basic identities through to complex logic circuit simplification using Karnaugh Maps. Created by an experienced Computer Science teacher and tutor with over 20 years in education, this pack is fully mapped to the AQA (7517) and OCR (H446) A-Level specifications. What is included in this pack? A 13-slide lesson presentation walks students through all essential and advanced Boolean identities — including the Absorption Law — explains both forms of De Morgan’s Laws with clear worked examples, and provides a visual, step-by-step guide to constructing and extracting simplified expressions from 2 and 3-variable Karnaugh Maps. A student worksheet reinforces learning with truth table proofs of Boolean laws, algebraic simplification challenges using De Morgan’s Laws, and practical K-Map plotting and grouping exercises. A homework task features challenging exam-style questions including a real-world smart security system scenario requiring students to write a Boolean expression, simplify it using a K-Map, and draw the resulting logic gate circuit. A complete teacher answer scheme provides full step-by-step algebraic working-out for every question on both the worksheet and the homework. Topics covered include: Essential Boolean identities, the Absorption Law, De Morgan’s Laws, Karnaugh Map construction and Gray code ordering, K-Map grouping rules, expression extraction, and full logic circuit simplification. Who is this for? Ideal for KS5 Computer Science teachers delivering the A-Level specification across AQA or OCR. Particularly well-suited to those who need a clear, mathematically rigorous structure for delivering this challenging topic. Save hours of planning time and give your students the best possible preparation for their A-Level Boolean algebra exam questions.

Complete GCSE Computer Science teaching pack on Database Normalisation (1NF, 2NF, 3NF). Includes lesson, worksheet, homework & full answers. AQA, OCR & Eduqas. Database normalisation is often considered one of the most abstract and difficult topics on the GCSE Computer Science specification. This complete teaching pack provides a clear, step-by-step approach to teaching relational database design, taking students from the problems of flat-file databases all the way through to Third Normal Form. Created by an experienced Computer Science teacher and tutor with over 20 years in education, this pack is fully mapped to the AQA, OCR (J277), and Eduqas (2020) GCSE specifications. What is included in this pack? A 13-slide lesson presentation walks students through the problems of flat-file databases — including data redundancy and update, insertion, and deletion anomalies — before explaining the rules for 1NF, 2NF, and 3NF using clear worked examples. A student worksheet reinforces learning with a keyword matching activity, short-answer theory questions, and a practical normalisation challenge based on a Vet Clinic database. A homework task features exam-style questions including a scenario requiring students to design a 3NF database for a school sports club. A complete teacher answer scheme provides full answers and working-out for every question on both the worksheet and the homework. Topics covered include: Flat-file vs relational databases, data redundancy and anomalies, primary keys and composite keys, First Normal Form (1NF), Second Normal Form (2NF), and Third Normal Form (3NF). Who is this for? Ideal for KS4 Computer Science teachers delivering the GCSE specification across AQA, OCR, or Eduqas exam boards. Particularly well-suited to NQTs or non-specialist teachers who need a clear, structured approach to delivering this challenging topic. Save hours of planning time and give your students the best possible preparation for their database exam questions.