Termly assessments for year 7, 8 and 9. Year 7 - E-safety Year 8 - Computer Parts Year 9 - Systems Architecture All questions are exam based, with 20% for LPA, 60% for MPA and 20% for HPA. Easy to mark and percentage, with simple feedback sheet at the end that can save you time and provide valuable feedback and direction for students to improve their work.

Set of binary/denary/hexadecimal lessons to be taught either at KS3 or for GCSE Computer Science. No worksheets needed for this lesson just books and whiteboards.

This is a full 60 minute lesson complete with technical terms on every slide, objectives, outcomes on every slide and exam questions throughout. Plenty of differentiation, support and challenge for students of all abilities.

This is a full 60 minute lesson complete with technical terms on every slide, objectives, outcomes on every slide and exam questions throughout. Plenty of differentiation, support and challenge for students of all abilities. This lesson can easily be altered into 2 or 3 lessons depending on ability. Great for revision!

This is a full 60 minute lesson complete with technical terms on every slide, objectives, outcomes on every slide and exam questions throughout. Plenty of differentiation, support and challenge for students of all abilities. The lesson can easily be split into 2 lessons to cover each individually. Great for revision!

This is a full 60 minute lesson complete with technical terms on every slide, objectives, outcomes on every slide and exam questions throughout. Plenty of differentiation, support and challenge for students of all abilities. The lesson covers sub-programs, procedures, functions, parameters and arguments, with definitions for each and exam questions on each. Easily adapted to be split over 2 or 3 lessons.

This is a full 60 minute lesson complete with technical terms on every slide, objectives, outcomes on every slide and exam questions throughout. Plenty of differentiation, support and challenge for students of all abilities.

This is a full 60 minute lesson complete with technical terms on every slide, objectives, outcomes on every slide and exam questions throughout. Plenty of differentiation, support and challenge for students of all abilities. Boundary / Normal / Erroneous covered. Data types for each. Error types = logical / syntax / runtime with great real life examples created by myself. Exam questions throughout.

5 pages of exam style questions (these have been created by myself in the format of OCR exam questions), with the answers (and examples) written on the following sheet. If printed back to back it provides students with exam question practice, in a booklet format, with answers for KS4 students to peer/self-assess the answers. This is a brilliant revision resource for a topic that covered 19 out of 80 marks on last years paper! Can be given to students as a homework/revision resource or used as part of a lesson (or 2 or 3) for writing pseudocode. This revision guide covers: algorithms pseudocode functions procedures IF statements loops MOD DIV constants variables

OCR GCSE Computer Science NEA work booklet. This booklet is designed to link the seemingly worthless NEA into a practical task that can be directly linked into various topics in paper 2. The booklet is 10 pages long (including a front page and contents page). It has exam style questions that bridge the gap between the NEA program and paper 2 concepts. It covers 2.1, 2.2, 2.3 and 2.5, with questions created in an exam style format, but linked directly to the NEA. The idea behind the booklet is that students complete this as they work through the NEA. They can either have short sessions in lesson completing topics, or complete it for homework after covering the content in lesson. A brilliant idea that makes completing the NEA much more efficient and effective.

A database with filters that allows the user to search for any question from GCSE Computing and Computer Science since 2011 (OCR-only). Very useful for selecting exam questions to give to students as a plenary/consolidate for individual lessons. easy to use, and will save you so much time. it has the marks for each question, the question type, the paper it was from (year and month), the key topic, sub-topic 1, sub-topic 2, sub-topic 3.

3 weeks worth of lessons - following on from the opening lessons for OCR Computer Science GCSE these lessons cover storage and memory (RAM and types of storage). This comes complete with an end of topic assessment with an easy marking box at the end.

set of criteria based on coding that each student must complete in order to gain a certain badge (Gold, silver or bronze).

2 lessons for binary images, to teach to year 10/11 for GCSE computer science.

A full set of lessons for 1.4 Wired and Wireless Networks. Designed to be delivered at pace, but can be stretched over longer periods for students who are struggling. Each lesson contains bell work, objectives/outcomes, teacher content and exam style questions. Some brilliant diagrams in these in PPTs to illustrate networks, if I do say so myself.

A full set of lessons for unit 2.4 Computational Logic for OCR GCSE Computer Science. The lessons cover all aspects of the specification in detail and up to grade 9 standard. All lessons contain bell work, objectives/outcomes, teacher content, exam style questions.

full set of year 7 assessments to be completed at the end of each topic. the assessments have the easy marking box at the end of the assessment and are all designed to be hand written. in this set of documents are also assessment criteria for each unit that fits into the new 9-1 grading. “I can” statements are used to help students understand what grade they are at and why.

Set of lessons that cover the entire content of unit 1.5 Networks of the GCSE OCR GCSE Computer Science course. L1 - Star and Mesh Topologies L2 - WIFI and Ethernet L3 - MAC and IP Addresses L4 - 7 Protocols L5 - Layering and Packet Switching Lessons include a bell work, objectives/outcomes, content to be learnt, exam question practice.

A set of 11 mini assessments that cover all topics from paper 2 of OCR GCSE Computer Science. These are exam based questions with easy-feedback on each sheet that allows rapid progress. These are designed to be completed during the lesson and should be completed in around 10 minutes (great starter or plenary!). The sheets are designed to be printed on one single sheet of A4 paper (2 sides), making them easy to organise and mark. The feedback method allows you to provide brilliant and effective feedback to students easily. A class set of 30 takes around 20 minutes to complete. These can be added together to create a larger assessment.

GCSE Computer Science Unit 2.6 full lesson set. Created for OCR, but the content may be suitable for other exam boards. L1 - Binary and Denary L2 - Adding Binary, Hex and Denary L3 - Binary and Hex L4 - Check Digits L5 - Binary Shift and ASCII L6 - Binary Images L7 - Binary Sound L8 - Compression L9 - Recap on Binary/Hex/Denary All of the lessons have a bell work, recap of key content, key content to be taught, in-depth explanations and exam question practice (with exam style answers). Structured to aid students understanding of a tricky topic.