Integrate key programming skills for GCSE Computer Science 9-1 with a Christmas quiz in Python. Programming techniques: Iteration, selection, counter, functions, procedures, menus, lists, inputs and output. A bit of fun to end the term, whilst continuing to develop programming skills.

In response to added emphasis on the Component 1 & Component 2 exams, following the NEA decision, I have re-structured my approach in lessons running up to the exams. Attached are two structured lessons which target specific 'question' styles at the beginning of the lessons, with revision of theory (based on OCR guidance - separate powerpoint theory on OCR website) before attempting a) for component 1, a QWC extended question or b) for component b, a writing algorithm questions. Over the coming weeks, as I develop the lessons to focus on areas of weakness shown in mock exams, I will upload further lessons in the hopes they can prepare your students for assessment as well.

Developed specifically for the GCSE Computer Science 9-1 Component 1 Exam. Based directly on the OCR Syllabus, it covers each element in bitesize chucks. A simple resource that can be used for independent revision, peer-to-peer Q&A and mix n’ match tasks. Golden Nugget Technique: Read a golden nugget. Read it again. Look away - what can you remember? Read it again - what did you forget? Read it again. Look away - have you remembered it yet? Repeat this process and learn the theory in little bitesize chunks Feedback from Parents Evening: “My child brought these home for revision. Even though I don’t understand the theory, I have the answers in front of me. I ask for a definition and compare his answers to those on the Golden Nugget. I can even give prompts because all the answers are there.”

Assessment on both Component 1 & Component 2 - on areas the Year 11 were struggling with. Marks out of 35 Solution and teacher mark grid provided.

Developed specifically for the GCSE Computer Science 9-1 Component 2 Exam. Based directly on the OCR Syllabus, it covers each element in bitesize chucks. A simple resource that can be used for independent revision, peer-to-peer Q&A and mix n’ match tasks. Golden Nugget Technique: Read a golden nugget. Read it again. Look away - what can you remember? Read it again - what did you forget? Read it again. Look away - have you remembered it yet? Repeat this process and learn the theory in little bitesize chunks Feedback from Parents Evening: “My child brought these home for revision. Even though I don’t understand the theory, I have the answers in front of me. I ask for a definition and compare his answers to those on the Golden Nugget. I can even give prompts because all the answers are there.”

Each revision lesson gets the students working independently for the first part of the lesson, followed by a review of the answers. A specific area of Component 1 is then revised, and the lesson concludes with a QWC question. If you have longer lessons, you could add in past exam questions from the A451 syllabus which are related. Independent questions: Topologies, Network Protocols Teacher-led revision (and questions as part of discussion): Network Topologies, Protocols & Layers QWC question: Choice of network topology for a school.

Interleaving lesson - testing theory already taught and focusing on areas for further study: Independent questions: Data Representation/Truth tables Independent questions: Programming Techniques/Data Types DTT Revision: Units of measurement, bytes, character set and check digit Teacher-led question: Check digit OCR Guidance: Arrays -1D/2D arrays Teacher-led questions: Arrays

Revision session - Focus: Calculation questions Storage capacity Converting between binary, denary and hexadecimal Binary shifts Binary addition Check digit calculations Questions & Solution provided.

End of Unit test Differentiated questions on Dangers to computer networks, identifying vulnerabilities and preventing attacks. Teacher solution provided.

Preparation for the GCSE Computer Science 9-1 Paper 2. Reminders on how to do sorting, searching and data conversion. Student questions (differentiated - some with ‘methods’, some with additional pseudocode challenge) - Teacher solutions to main questions. DTT Revision - Key Areas: Data structures, errors, robustness and data types ( Therapy - as identified in mock exam).

Scheme of Work for Component 2 LA1 Role of Data and Information. Example lesson resource.

Let’s Do It Activities Designed as lesson starters for component 2 - revision of the different data conversion methods: Binary to denary and vice versa, binary to hexadecimal and vice versa, denary to hexadecimal and vice versa, binary addition, binary shift to the left, binary shift to the right, and finally as mentioned in the spec, (how to calculate) the check digit. Each conversion is illustrated through worked examples and tips on how to convert with three practice questions that students can work on independently. In my lessons, I will have a folder with the solutions in so that students can self-mark once they have completed the activity. To follow shortly: Let’s Do It Activities for Sorting & Searching Algorithms and Logic Gates.

Let’s Do It Activities Designed as lesson starters for component 2 - revision of the different methods for searching and sorting: Binary search, linear search, bubble sort, merge sort, merge sort lists and insertion sort. Each method is illustrated through worked examples and tips on how to search/sort with three practice questions that students can work on independently. In my lessons, I will have a folder with the solutions in so that students can self-mark once they have completed the activity. To follow shortly: Let’s Do It Activities for Programming Techniques.

This resource has been developed based on student feedback from the Paper 2 2018 and the Paper 2 Examiner Report extract: “Candidates who did well on this paper generally… Understood the use of SQL and wildcards.” This resource provides: Syntax, example for a fruitShop table and practice with a bakery table. Solution provided - in lesson, I will get students to self-check against a printed copy of the solution. Thanks for taking an interest in this resource.

Complete module that takes a Key Stage 3 student from visual-based programming to text-based programming in a term using: Visual-based: Logo, Kodu and Scratch; Text-based: Reeborg and Python Knowledge Build Cards (KBCs) have examples and tasks for students to complete. Integrated teacher assessment (mini-writes) every 6th lesson, with a ‘Big Write’ at the end. Taught during the Autumn term to students who have no previous programming knowledge and the ‘building process’ from visual-based to text-based programming ensured all students grasped concepts so that they were more confident when introduced to Python.

Differentiated self-assessment sheets for the main units in the new OCR GCSE Computer Science 9-1 - Unit 1 Computer Systems. Gauge the progress of students against their ability - Low Ability Pupils (LAP), Middle Ability Pupils (MAP), High Ability Pupils (HAP) and Most Able pupils (MA). Use as a progress check for students, and as a check for teachers that they are covering the content outlined in the OCR GCSE Computer Science 9-1 specification.

Start the lesson with Nimble Numbers - in this resource, convert binary to denary numbers.

Use these AfL checklists as you cover theory for the A451 exam. Differentiated for main topics to identify where students need more help in preparation for their exam.

Start a Computing lesson promptly with some numbers! Convert denary to binary - solution provided on final slide in presentation.

These Key Concept sheets show the key skills that can be used in reports to engage the reader and to present information visually.