<p>Used to show the stages of language generation, this lesson is used in GCSE a Computer Science Lesson as an introduction programming Languages 2.5.1. I use it with OCR J277 but it is also relevant to other specifications. It contains 26 slides explaining the topic, and is used as one lesson, with the scope to use part of it as a homework.</p>

<p>A keyterms glossary for OCR GCSE Computer Science Component 2 Algorithms and Programming</p>

<p>This lesson is written in a flipchart created for use with Active Inspire programming.</p> <p>This is a lesson that I used to teach the children in my class about algorithms and programs in computing. It is an unplugged lesson, no computers required! It explains how coding works in a child friendly way. I used it with Year 4 at the beginning of our coding topic.</p>

<p>Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Linear Programming.</p> <p>Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach with worked examples of A Level standard. Format is such that students can also use as revision at their own pace and includes a handy flowchart for revision.</p> <p>The full set of 16 PowerPoints in this series cover the whole of the Edexcel D1 course:</p> <p>Algorithms<br /> Bin-Packing Algorithm<br /> Critical Path Analysis (GANTT)<br /> Dijjkstra’s Shortest Path Algorithm<br /> Floyd’s shortest distance algorithm<br /> Graphs &amp; Networks<br /> Kruskal’s Minimum Spanning Tree<br /> Linear Programming<br /> Planarity Algorithm<br /> Prim’s Minimum Spanning Tree<br /> Route Inspection Algorithm<br /> Simplex Algorithm 1 - Edexcel tableau<br /> Simplex Algorithm 2 (artificial variables) - Edexcel tableau<br /> Simplex Algorithm 3 (Big M method) - Edexcel tableau<br /> Sorting Algorithm: Quick-sort, Bubble-sort (&amp; Shuttle-sort for OCR)<br /> Travelling Salesperson Problem, including Nearest Neighbour Algorithm (+ tour improvement algorithm for OCR)</p> <p>Updated 2022</p>

<p>This resource can be used for year 8 for National and IGSCE British <a href="http://curriculum.It" target="_blank" rel="nofollow">curriculum.It</a> is the starting of introducing programming through turtle graphics in python. Students start with turtle and then enter into main python programming.</p>

<p>Based around an introduction to algorithms, a total of 5 lessons are included in this package.</p> <p>Aimed at GCSE Computer Science, the 5 lessons are aimed at promoting an introduction to algorithms using decomposition.</p> <p>Every lesson comes complete with a teachers PowerPoint, iterative starter activities, lesson resources and an ‘Independent Learning Time’ section (this is aimed at allowing students to work independently to consolidate their understanding). Answers to flowchart and pseudo code tasks are included on the PowerPoints.</p> <p><strong>Lesson 1:</strong><br /> Introduction to algorithms using flowcharts, starts off with basic flowcharts based on easy scenarios and builds up to looking back at sound storage and representing this process as a flowchart.</p> <p><strong>Lesson 2:</strong><br /> Looking at more complex flowcharts to represent algorithms, focusing more on selection and iteration within algorithms. Independent Learning Activity includes exam questions for students to decompose problems and represent as flowcharts.</p> <p><strong>Lesson 3:</strong><br /> The focus of this lesson is to allow students time to work independently at solving complex algorithms as flowcharts. Using sequencing, selection and iteration a range of exam questions are included. Class activities are included beforehand to recap the learning of flowcharts.</p> <p><strong>Lesson 4:</strong><br /> An introduction to pseudo code - links the understanding of what pseudo code is to Python code which students may have come across beforehand from their NEA. Different examples of how code should be constructed are included. Several flowcharts are included on the PowerPoint which students then need to turn into pseudo code. Sequencing and selection are focused upon in this lesson.</p> <p><strong>Lesson 5:</strong><br /> Developing students understanding further using sequencing, selection and iteration. WHILE loops are demonstrated of how to construct a loop in pseudo code. Students will spend their time working on problems and trying to decompose these into pseudo code. Extension questions are included for the HAL students / students needing extra or more challenging work.</p>

<p>This flowchart shows the links between fixing errors and resilience and also that repeated practice leads on to mastery, the more programming is practiced, they better you will get!</p> <p>The flowchart algorithm can be used in classes as a discussion point and a display. The embedded graphic can be resized, printed, cut-out and stuck into exercise books as a reminder that making mistakes is OK, normal and part of the programming cycle.</p>

<p>This lesson covers Algorithms used in programming.</p> <p>This does not include a lesson plan, but will distribute for free as i used resources from a colleague.</p>

<p>Learners are introduced to <strong>theory (including mathematical concepts) , design and programming</strong> using <a href="http://VB.NET" target="_blank" rel="nofollow">VB.NET</a> and Python. An exciting and in-depth look at <strong>Binary Search algorithm</strong> as used in computer programming. 2-6 hours of lessons. The resource also comes complete with <a href="http://VB.NET" target="_blank" rel="nofollow">VB.NET</a> project files and Python scripts. This is suitable for A Level Computing or any other Level 3 computing course. Can also be used for GCSE computing.</p> <p><strong>40 Page detailed handout</strong> containing theory, explanations and code listings.</p> <p>This is a self-contained learning material and can be given to students who can then work independently. Can be used for 2-6 hours of learning. Alternatively handouts can be used by teacher to guide students step by step depending on ability.</p> <p>The document is organised into two main sections:</p> <ol> <li> <p>Section 1 - Learners are introduced to the theory underpinning Binary Search. Learners create a number guessing game in <a href="http://VB.NET" target="_blank" rel="nofollow">VB.NET</a> / Python to help understand the concepts behind Binary Search. This is very useful for beginners new to algorithms. Program teaches, selection and iteration. Typically section 1 can be used for a 2 hour lesson and learners enjoy creating the program and learning about the theory behind binary search.</p> </li> <li> <p>Learners understand how Binary Search works . Learners then create a Binary Search program in <a href="http://VB.NET" target="_blank" rel="nofollow">VB.NET</a> / Python. Learners use <strong>Arrays</strong> and learn selection and iteration. There is an advanced implementation using <strong>Lists</strong> which can be used to introduce lists, sub procedures and functions. Typically section 2 can be used for a 2 hour lesson.</p> </li> </ol> <p>The handout comes with all the Microsoft Visual studio 2013 projects created using <a href="http://VB.NET" target="_blank" rel="nofollow">VB.NET</a> and Python script files created using IDLE. There is a stronger emphasis on <a href="http://VB.NET" target="_blank" rel="nofollow">VB.NET</a>.</p> <p>There are 7 <a href="http://VB.NET" target="_blank" rel="nofollow">VB.NET</a> projects associated with this handout. Two of these are for teacher use but learners can implement these also in addition to the 5 other projects.</p> <p>There are 2 Python scripts.</p> <p>Abrar Hamid<br /> <a href="mailto:abrar.hamid@stcg.ac.uk" target="_blank" rel="nofollow">abrar.hamid@stcg.ac.uk</a></p>

<p>Learn how to implement <strong>Linear Search</strong> algorithm to search Arrays and Lists using <strong><a href="http://VB.NET" target="_blank" rel="nofollow">VB.NET</a></strong> (Console applications and Windows application) and <strong>Python</strong>. Suitable for GCSE or A Level Computing or any other Level 3 computing course. This is a self-contained learning material and can be given to students who can then work independently. Can be used for 1-3 hours of learning.</p>

<p><strong>Programming algorithms for drawing shapes</strong></p> <p>In this programming activity, students will use the programming language Logo to understand and create algorithms for drawing shapes. Through creating their own unique shapes via algorithms, students will see their code come to life on screen.</p> <p>This is one of a set of resources developed to aid the teaching of the secondary national curriculum, particularly KS3. It has been designed to support the delivery of key topics within maths, engineering and computing.</p> <p><strong>Activity: Programming algorithms for drawing shapes</strong><br /> The first part of this activity is intended to encourage students to examine a sequence of instructions, look for a pattern, and explain this pattern. The next problem asks the students to continue the pattern, making deductions about how the pattern will continue. Students are then challenged to produce a set of instructions for drawing different shapes before trying some designs of their own. They will be encouraged to use an online logo app like Papert to try out their instructions. Problem-solving questions will stimulate students to identify and extend a sequence, requiring reasoning and proof.</p> <p><strong>The engineering context</strong><br /> Algorithms form the backbone of many engineering processes, from automation and improving efficiency to data analysis and problem solving. As such, learning about algorithms prepares students for more advanced engineering studies.</p> <p>Pythagoras’ theorem and trigonometry are fundamental in multiple engineering fields such as civil engineering for structural design, electrical engineering for signal analysis, and mechanical engineering for understanding dynamics and mechanisms.</p> <p><strong>Suggested learning outcomes</strong><br /> This lesson plan aims to cover potential GCSE content such as identifying and explaining patterns and sequences, understanding the exterior angles of shapes, and applying Pythagoras and trigonometry. In the process, students will also develop key problem-solving skills as they predict sequences, work out instructions, and discuss their reasoning. This activity will also give students a deeper appreciation for the role of algorithms in our daily lives.</p> <p><strong>Download our activity sheet and other teaching resources</strong><br /> The activity sheet includes teachers’ notes, useful web links, and links (where appropriate) to the national curriculum in each of the four devolved nations; England, Northern Ireland, Scotland and Wales.</p> <p>All activity sheets and supporting resources are free to download, and all the documents are fully editable, so you can tailor them to your students’ and your schools’ needs.</p> <p>Please do share your highlights with us @IETeducation.</p>

Two flipcharts that will help with teaching coding and language associated with it, in Computing (ICT).<br /> <br /> Ties in with this KS2 outcome:<br /> design, write and debug programs that accomplish specific goals, including controlling<br /> or simulating physical systems; solve problems by decomposing them into smaller<br /> parts

NOTE: You will need a subscription to TES elements to be able to make full use of this planning.<br /> <br /> Complete planning and resources for 6 weeks of Computing on Algorithms and Programming for Year 1.<br /> <br /> There is a PDF and an editable version of each file (you just need to delete the Save Teachers' Sundays logo from each of the editable files)

<p>This “Algorithms and Programming” unit is designed for Key Stage 2 students, which is based on the national curriculum. The unit aims to introduce students to the concepts of algorithms, and how they are used to solve problems. It also covers the basic concepts of programming, such as variables, loops, and conditionals. Additionally, it provides an opportunity for students to use a visual programming language to create simple programs, and develop debugging skills to identify and correct errors in their programs. Each lesson includes interactive activities, group work and practical tasks and each lesson has a specific learning objective. The unit concludes with a final project where students will be encouraged to be creative and innovative as they apply what they’ve learned. Assessment throughout the unit is formative and summative, providing students with regular feedback and an opportunity to showcase their final project at the end.</p>

<p>This PowerPoint includes what students need to know for the unit of object orientation for AQA. The PowerPoint slides include :</p> <ol> <li>What is OOP?</li> <li>What is a class and an object</li> <li>instantiation</li> <li>encapsulation</li> <li>inheritence</li> <li>aggregation</li> <li>composition</li> <li>polymorphism</li> <li>overriding</li> <li>favour composition over inheritence</li> <li>methods</li> <li>tasks for students o complete</li> </ol> <p>I have used this PowerPoint to support my students in introducing OOP to them.<br /> I hope you find this useful.</p>

<p>Keyword bingo game covering Algorithms &amp; Programming. The teacher reads the clues; students must cross off the relevant keyword if they have it. The game ends when a student has all clues crossed off or achieves a straight line - you decide.</p> <p>Includes a set of 50 unique bingo cards for students, plus clue and definition list for the teacher. Fully editable resource.</p>

<p>A set of 7 full lessons for KS3 (Year 7/Year 8) on Scratch Programming.</p> <p>Lessons cover:<br /> Lesson 1 &amp; 2 - Introduction into Scratch, What are Sprites, How do we add a background, How do we add a sprite, How do we control sprites, What is looping/loops, Creating Variables in Scratch, Creating loops in Scratch, Creating a simple game of cat and mouse in Scratch.<br /> Lesson 3 - Understand what a costume is and how to create one, Understand what broadcast means and where we find this code block, Finishing off the cat &amp; mouse game in Scratch off.<br /> Lesson 4 - Understand how to sense events and where to find this in Scratch, Understand what a variable is and where to find one in Scratch, Creating a game of shark attack in Scratch.<br /> Lesson 5 - Understand what sensing is and how it is used in Scratch, Understand what a variable is and where to find them, Understand how to draw our own sprite using the paint feature, Apply our new knowledge to start creating a Flappy Bird game.<br /> Lesson 6 - Understand what coordinates are, Understand how coordinates affect the movement of characters, Understand how to use the coordinates code blocks to move our character, Continue creating our Flappy Bird game.<br /> Lesson 7 - Understand how to add pipes to our Flappy Bird game, Understand how to use operators to compare variables, Understand how to add a high score feature to our Flappy Bird game, Understand how to add instructions to our Flappy Bird game. Add to our game using the extension/challenge tasks.</p> <p>Lessons include:<br /> Teacher Slides PowerPoint<br /> Student Worksheets (Word Documents)<br /> Starter &amp; Plenary Activities (Word Documents or in Teacher Slides PowerPoint)<br /> Extension Tasks (Word Documents)<br /> Extra Class Work - Scratch Booklet (Word Document)</p>

<p>Dijkstra’s Algorithm</p> <p>The way I would run this is to talk through the motivation for the algorithm from the presentation, and give the terminology worksheet to be filled in (answer in the presentation). We’d then work through the brute force worksheet. I might then run through the example, then give them the simple graph to fill in. Than we would work through TaskGraph1 for the graphs. Then I might get them to either code, or come up with graphs for them to solve in small groups or in pairs.</p> <p>Included:<br /> TPT presentation<br /> Labels to fill in worksheets to give structure for the students to fill in answers<br /> TaskGraph1 3 graphs to run Dijkstras on.<br /> AnswerGraph1 and 2 -answers for the graphs<br /> Brute force worksheet and brute force worksheet answers</p>