1. Resources Home
2. High School
3. Computing
4. Computational thinking
5. Algorithmic thinking

#### Scratch DIRT SHEET - Assessment

Created this DIRT sheet for my Year 8’s but can be used for any year group. SIMPLE TO FOLLOW Teacher can look through their scratch projects and tick the boxes the pupils have covered in their Project. Pupils can then reflect on their project and suggest improvements they could make.

#### Investigation: The Algorithmic Production of Knowledge.

A Mathematical Investigation Assessment Item for Year 8 &amp; 9 looking at algorithms with Excel and Python.

#### What is an ALGORITHM

An introduction to algorithms using a flowchart with sequence, selection and iteration. The worksheet provided enables students to slow down their thinking to focus on each instruction in the algorithm until the last instruction is executed and the program ends.

#### Kodu-Rhythm Lesson 3(An Introduction to coding using Kodu)

Kodu is a friendly graphical programming language where students can build their own world and program objects within. This series of lesson uses kodu to introduce computer science terminology such as algorithm and variables to develop computational thinking skills.

#### [GCSE+IGCSE] Python Text Adventure Coding Challenge

This is possibly my most favourite piece of work to do with the students. I do it as an end of year activity when they are a bit more confident with the material. We create a zombie survival text adventure game and I have recently updated it to include questions similar to what has been in the recent exam and in the exemplar exam What is covered Local and Global Variables Variable Types Input and Validation Conditional Loops Fixed Loops Arrays Subprogram calls (Functions, Procedures and Pre-defined) Libraries Complex conditions and selection Repetition and Iteration What is included Word document with instructions, task overview and more detail on the activity Student Starting Python file (in zip folder) Teacher completed exemplar file Answer document to questions

#### [GCSE+IGCSE] Exam Style Questions on coding

Exam preparation questions on coding for Paper 2 Content Question sheet Zipped folder of Python code

Activity to practice encoding and decoding messages with the Vigenere Cipher

#### [GCSE + IGCSE] Caesar Cipher Encryption and Decryption Task

Simple activity to practice encrypting and decrypting messages with the Caesar Cipher

#### [GCSE+IGCSE] Mini Project: Pentathlon

This is another of the mini projects that I get my students to complete in preparation for completing the coursework. Lesson Overview Depending on ability level, we start by completing flow charts and pseudocode to complete the design of the program. I sometimes prepare a complete one, but blank out some of the steps to give to my weaker students. Better students I will give blank designs to and somewhere in between for the other students. At end of this lesson, we look at how the code works In preparation for the next lesson, I get the students to watch the video as a homework task. The next lesson, the students complete the program using their pseudocode / flow charts completed in previous lesson. If they are still struggling, they can watch the video again in class time, as well as me able to wander around and help. Students who are better at coding will easily be able to add more functionality to this project Included Zipped file contains: 2 CSV files required for the project and the completed solution file (1 of the CSV files is the file writing part) Video Support of completing the solution Whilst this is mainly aimed at students, it would be useful PD for any Computer Science teachers who are still struggling to understand the complex programming side of the course What this teaches File Reading from CSV file File writing back to CSV file Storing Data in 2D arrays Functions/Procedures Parameter Passing Complex Functions (Finding Minimum algorithm using 2D arrays) Combining

#### [GCSE+IGCSE] Mini Course work project with Video and Solution Computer Science

This is a smaller project that uses File Reading, 2D arrays and some manipulation of the data stored in it. A complex project, smaller than a final year project, but building in complexity. Included: 3 solution videos, completed solution file (.py) and zipped (TES doesn’t allow this file type) with the CSV file to access - save these in the same folder, or your program will not work

#### Computer Science Algorithms Test

This is the test my students complete after they have finished my Algorithms and Problem Solving unit.

#### [GCSE + IGCSE] Python Coursework Mini Project 2D arrays, File Reading and Writing and Sorting

**Teaching Duration: ** For main tasks, 3 lessons. This task can be expanded to challenge the top level students to add more and more features in. A further 1 to 2 lessons where we reverse engineer the flow charts which is very useful skill for the final exam Who is it for: Students studying GCSE in preparation for final project. Students studying IGCSE who are consolidating their skills at developing a large project. Also useful for staff struggling with teaching the course What’s included Instruction File: Includes detailed instructions and code that students should enter to complete the project Student File: partially completed code that students add to Teacher File: Completed project Text File: This project includes file reading, this is the text file to use. Make sure to save it in the same folder as the python file, or it will not work This covers every area of the programming side of the course from Units 1 and 2 completely. This is a perfect project for students to practice a larger project before tackling the coursework, or as a revision task for the practical exam / paper 2 by reverse engineering code/pseudocode and flow charts which is always a tricky area to learn. This has been in all exemplar papers, as well as the 2018 exam.

#### [GCSE+IGCSE] 2D Arrays introductory Task

Activity is written using standard pseudocode/python, so easy to change and update for any other programming language . Use this to introduce arrays and records and discuss the diffrences between them both - with python coding in mind, as well as the exam based pseudocode being different from Python Questions from the new curriculum on 2D array data manipulation

#### Scratch [Modelling and Simulation]

My activity booklet for building a model of a the solar system in Scratch. Students complete some Internet research first (gives us a chance to look into searching techniques, fake news and logging data/information) We then spend a few lessons coding the solution to the model, getting the sun to rotate around the sun. Adding the moon to rotate around earth and then adding the other planets. This is a really fun activity that I use as a transition from talking about Internet safety, Internet skills to programing in Scratch, I have also included an example solution file, so you can learn how to code this particular solution, as well as demonstrate a working model the students.

#### Python Problem Solving Algorithm and Coding Challenges [GCSE + IGCSE]

A series of 11 coding challenges for students. This is a unit of work that I complete once my students have seen the basics of coding and have used the Mathematical Operators in Python (MOD % / DIVISION // INTEGER DIVISION) There are a variety of logical puzzles to work through and solve. I have included the solutions to all problems (11 Python files in ZIP format (TES doesn’t support direct upload of .py files)) For this unit, I had students work in groups. For my students who were struggling, I prepared some files with the pseudocode already typed in, or I hand drew some flow charts for some differentiation. For many of these, it would be very easy to build on and challenge your top level students to make some of the challenges even more difficult.

#### Scratch Programming Fractal Tree Activity

One of the areas of the national curriculum that we should be introducing students to is RECURSION. This is an excellent activity to introduce that concept in a visual way with a simple task to create a fractal tree in Scratch programming. This activity I had a learning observation on. I had my students work in small groups to try and complete the main activity together. When they finished this, they were to research other fractal activities on-line and see what they could create. Students really enjoyed this activity at the end of the Scratch topic to introduce a very complex topic that is not part of GCSE, but that appears again at IB level and A level. I expect students to learn that recursion is a complex rule that simplifies programs, but is very difficult to understand and it is a function that uses itself to solve a problem.

#### Scratch Programming Test 2 + Answers

End of section test (I use with Y8 students) to assess their comprehension of coding using Scratch (I have uploaded my unit of work which goes with this. This is used a long with the assessment activity uploaded in the other unit of work, to check student progress. This is a problem solving assessment which tests students abilities to read and interpret code, as well as explain it. Checks their logical and computational thinking skills and ability to spot and correct errors.

#### [GCSE + IGCSE] Introduction to Algorithms (Problem Solving)

This is the unit that I complete before I start programming with my GCSE students. It features a variety of problem solving activities that I use to introduce Flow Charts and Pseudocode. This has massively helped my students understand the concepts and process of planning before progressing onto writing code. This covers a lot of the concepts of Unit 1 and Unit 2 from the curriculum. Introduces the ideas of Abstraction, Decomposition, Algorithms etc

#### [GCSE+IGCSE] Computer Science PYTHON Arrays

Included: 10 project based activties. These address some standard algorithms (Search, Find Max and Min) and build into some menu building areas which uses Functions/Procedures. Solution files to all projects, including any advanced/challenge areas Links to video lessons for some projects End of Unit Project activity This is my very expansive unit of work on functions. This is the second last unit of work that I complete with my GCSE students, before we start the project (the final one being 2D arrays and records with File Reading/Writing, as well as some example projects) This is a very thorough set of activities which are all mini projects. Depending on the time you have, you could take each activity in turn and spend time designing, implementing and testing each of them. SOme of them I worked on and completed in pairs. There are 10 projects in total, each with a solution which has been fully tested. In some cases, to support my weaker students I spent some time making video lessons. These are hosted on youtube and are private and not accessible without the links in the documents - useful for professional development, for students who miss lessons or to support lower ability students (some of the areas covered are more advanced, so in fact my strongest students were also using them to advance their skills)

#### [GCSE+IGCSE] Strings, Functions and Procedures Unit

This is my Strings, Functions and Procedures unit that I use in the lead up to the end of Term 1 at Christmas. It compromises 9 individual tasks. Each of these tasks, I take at least two lessons to deliver with students. I start off each with some starter questions (included file) and a discussion of the task. At this point, I would expect my students to be comfortable with planning in pseudcocode and flow charts. For each activity, I either get them to design it for Scratch, or I create a partially completed plan which they then fill in the blanks (These are usually hand drawn, so I didn’t include them) We then code the solutions which normally takes a full lesson. To support and challenge students, several activities contain challenging scenarios to keep better students engaged allowing me to support weaker students to aim towards completing minimum requirements. After we completely implement them, we spend time discussing test plans, the purpose of testing etc. This covers a lot of the theory in the course of looking at modular testing, why we use predefined functions/procedures, how large groups of programmers work together to decompose a task and implement it simultaneously etc. For each of the 9 activities included, I have included blank student files (when they are required) tested solutions for each activity and the overview of the task with instructions. For this activity, it will require a bit of teacher input to explain task at the beginning. At this point, I show students the completed activity, so they know what they are aiming to produce. For my weaker students, I give them a copy of the completed code (eventually) and get them to add internal commentary, or do testing. In some cases, I make simple syntax errors in it and get them to fix it. This activity booklet takes me around 8-10 weeks off 3 lessons per week. We use the Christmas themed lessons at the end, this introduces/recovers arrays, as well as some challenging problem solving that we all work on in groups to complete.

#### Lesson: algorithms, decomposition and anstraction

The lesson is suitable for KS3 / GCSE Computer Science. Starter, asking pupils to comment on an article about the impact of algorithms Presentation on what an algorithm is, giving examples of algorithms, different kinds of computer algorithms and how these sets of instructions can be developed into a program. Sample python programs supporting the presentation on algorithms Presentation on decomposition saying what it is, giving examples and looking at how decomposition can apply to programs effecting the way a person programs (eg functional programming) Task to decompose an authentication probem. Presentation on abstraction, looking at what it is, giving examples and considering what data can be removed as part of the abstraction process. The pupils are given a task to remove any unecessary detail from an algorithm. The pupils complete five abstraction questions . Plenary, the pupils split into pairs and are given a problem. One person explains in a series of steps how to solve the problem (decomposition), whilst the other person tries to intervene to remove any unecessary detail from the explanation (abstraction) Homework task on how to make toast breaking this problem down using decomposition / abstraction.

#### [GCSE Computer Science] 2D Arrays Introduction [IGCSE also]

A series of activities to introduce students to 2D arrays. This is an area my students regularly struggled with understanding the concept. This year their test results were much improved compared to my last year groups - I believe this is mainly down to spending more time on getting students to visualise where data is, how it is stored and accessed. We spent a week on this activity - discussing the theory at the beginning of the lesson, tracing the execution, coding the solutions and then practicing writing flow charts for the equivalent pseudocode. I also updated this to work with records, but I will upload as a separate resource,

#### Edexcel Computer Science 9-1 paper 2 half a terms lessons

This half a term worth of lessons cover: error types data types relational databases test Each lesson begins with the basic concepts, then adds until they are at GCSE level. Students have been very engaged with this work.

#### Edexcel Computer Science 9-1 Paper 2 bundle

This is a whole half term of work relating to the questions appearing in the second Computer Science paper. The lessons are on input, processing, output selection statements boundary testing recognising constructs trace tables a test The lessons guide the learner from easy to understand exercises, to GCSE level exercises. There is a learning question focus for each lesson, but in some cases the bronze silver and gold outcomes have been left blank for you to tailor to your classes. There is enough work here for a half term.

#### Lesson: efficiency of algorithms

The lesson is suitable for GCSE / KS3 Computer Science (see other similar lessons in this series) To understand that more than one algorithm can be used to solve the same problem. To compare the efficiency of algorithms explaining how some algorithms are more efficient in solving algorithms than others, specifically space and time efficiency of algorithms Please leave a comment if you like the resource. Lesson plan Presentation on space efficiency that looks at a simple algorithm of adding up consecutive numbers (eg 1 + 2 + 3 + 4 … ) in a sequence, then compares this approach with using a loop and then looks at using an equation to solve the problem as an example of space efficiency in an algorithm. Pupils program these algorithms for themselves to see how lines of code can be reduced in a program. The above presentation is supported by three python programs (eg sequence, loop, equation python programs) Presentation on time efficiency that looks at two algorithms (one using a loop and another using an equation) to see which ones are more time efficient. Pupils program these algorithms to see how execution time of a program can be reduced. The above presentation is supported by two python programs (eg loop and equation python programs) The pupils are then given a program task to try to create a program that will calculate the nth term of the sequence 2, 4, 8, 16 in the most efficient way. A stretch and challenge exercise considers how to program a more difficult sequence of numbers Plenary presentation quiz to test pupils knowledge Homework looking at definitions of space and time efficiency and an example algorithm (answers provided)

#### [GCSE+IGCSE] RECORDS ARRAYS FLOWCHARTS

A series of 6 activities (15 lessons following structure below) that can either be used to introduce Records, Arrays and Flow Charts, or as a revision tool at the end of introducing these. With each activity, I spend time going over the skills at the beginning of the lesson, with the students completing the flow chart in each scenario. For each activity, I have included extension activities to challenge the more advanced students. After each flow chart is completed, we review the learning at the end of the lesson. The second lesson for each, we review the learning from the previous activity and then code the solutions. I often do these in a mix of group and paired programming scenarios. This would also work well as a carousel activity, giving a set time at each station or, working in groups, students could implement the solutions for them and present their learning back to the rest of the class All in, covering theory, taking time to implement the code, and with testing at the end, this short set of activities takes us around 15 lessons and hugely benefited my students in the Paper 2 in the recent exam. There were a few questions which came up with regards to manipulating records / writing to files which, following these activities, my students were very confident with. This exercise was also used during a Looking For Learning classroom observation.

#### Low level programming languages practical lesson - GCSE Computer Science

Practical lesson on low level languages, focusing on assembly language. The bulk of the lesson is practical programming exercises using the Little Man Computer (LMC). By comparing their existing knowledge of a high level language with these assembly language programming tasks, pupils should be able to grasp the differences between the two types of programming language. The plenary reinforces these differences. Includes a worked example, 6 differentiated assembly language program activities, an instruction set help sheet, a short lesson plenary, and a longer version that can be used as homework (both with answers). Fully editable resource.

#### Logic Gates, LogicTables and Boolean Algebra Practice (GCSE)

GCSE Computer Science Resource for Unit 2.4 Computational Logic. Practice interpreting and drawing logic diagrams using a range of methodologies. Teacher marks scheme included.

#### Lessons: linear & binary search, bubble & merge sort

Includes the following x1 hour lessons: linear search binary search bubble sort merge sort Format of the lessons: Starter activities Presentations Simulations Worksheets Stretch &amp; challenge activities Plenary assessment Homeworks

#### Lesson: Merge sort, (lesson plan & x 6 resources)

Lesson: Merge sort, (lesson plan &amp; x 6 resources) (GCSE Computer Science) • To understand and explain how a merge sort works An easy to follow and timed lesson plan (x1 hour) that includes x6 resources. Starter activity where pupils compare the performance of the bubble and merge sort. A merge sort presentation that introduces and explains the sorting algorithm (divide &amp; conquer) A link to a merge sort simulation demonstrates a working model An worksheet exercise to dry run the merge sort algorithm (answers provided) There is a sample merge sort written in python that the pupils edit and make changes. A stretch and challenge exercise to program the first half of the merge sort. A plenary exercise containing an x8 question assessment on the merge sort A homework to represent the performance of the bubble and the merge sort on a chart

#### [GCSE + IGCSE] Computer Science Programming (Visual Basic)

Advanced programming resources for teaching IGCSE + GCSE Computer Science and beyond This is also useful for anyone teaching IB Computer Science using Visual Basic 8 individual ‘activities’ with advanced challenges for each. More than 8 lessons work once I build in introduction, designing of the code and plenary reviews at end of lessons. Taking our time to build up skills, do traces on the code etc, each takes (or could take) three lessons to thoroughly cover the knowledge

#### Lesson: Bubble sort, (lesson plan & x 6 resources)

Lesson: Bubble sort, (lesson plan &amp; x 6 resources) (GCSE Computer Science) • To understand and explain how a bubble sort works An easy to follow and timed lesson plan (x1 hour) that includes x6 resources. Starter activity where pupils watch a video comparing the performance of different sorting algorithm A bubble sort presentation that introduces and explains the sorting algorithm (includes a flowchart) A link to a bubble sort simulation demonstrates a working binary sort model A further presentation demonstrates how to code a bubble sort in python There is a sample bubble sort written in python A stretch and challenge exercise to identify what happens when the number of data items in the list grows A plenary exercise whereby the class are separated into two teams (A &amp; B) and each team are asked a series of questions about a bubble sort A homework to research three difference between a bubble sort and a merge sort (answers provided)

#### [IGCSE + GCSE] Computer Science Tests x7

7 tests for variety of units at both IGCSE and GCSE Binary Representation X 2 (covers all of this unit) Computer Systems (covering basics with RAM, to processor parts, to fetch execute and von neumann) Logic Gates x 1(covers full unit) Networking x2 (covers full unit) Encryption X 1 (covering all aspects of Encryption) Simple basic define questions, multiple choice and more difficult extended questions when appropriate.

#### [GCSE + IGCSE] Computer Science Trace Tables, Algorithms and Efficiency

This is an excellent resource that I have created and used with my Y10 and Y11 GCSE class (Y10 are IGCSE, and is relevant to both courses) I use this as a collaborative carousel activity where students in pairs (or however you want to work it) look at two algorithms at a time, tracing the values of the variables. This is a problem solving activity that should hopefully challenge students Computational Thinking, as well as revising their skills with Trace Tables and predicting output of code, as well as spotting Logical errors. I have also used it to introduce the idea of preprocessing. This series of activities leads nicely into more challenging activities, such as sorting of data. When I teach this lesson, I use some theory resources and plenary activities, as well as some on-line quizzes over 3 lessons. Had a looking for learning observation whilst using these activities and feedback from observation was excellent. Having reviewed it with students, their feedback was (a long with the Data Structures activities uploaded and used prior to these activities) is that it really helped them to visualise how data is stored and manipulated in arrays, as well as introducing preprocessing (which appeared in this year exam) as well as revising trace tables. Allowing the students to work in collaboration, discussing with one another and doing some peer review tied in neatly with some of the observational areas which we are looking at with ATL and Life After Levels. I was also toying with doing this as a group presentation activity, where the students can ‘lead’ this activity and ‘Be the Teacher’ explaining the inefficiency of their algorithm and how the data can be as issue also. This was also a perfect opportunity to revise why we use arrays in the first place - as I got students to re-write the code without arrays and it was a crazy series of IF statements, so plenty of scope to draw in other areas of the course.

#### Lessons: linear & binary search

Lessons (x1 hour) on linear and binary searches and logic gate presentation GCSE Computer Science. Starter activities Presentation on linear and binary searches View simulations of both searches Worksheet questions Stretch &amp; challenge activities Plenary Homeworks (Logic gate presentation included)

#### Lesson: Binary search, (lesson plan & x 12 resources)

Lesson: Binary search, (lesson plan &amp; x 12 resources) (GCSE Computer Science) • To understand and explain how a binary search works An easy to follow and timed lesson plan (x1 hour) that includes x12 resources. Starter activity where pupils run a python program and share ideas how they would search through it to find an item A binary search presentation that introduces and explains the search algorithm A link to a binary search simulation demonstrates a working binary search model A further presentation demonstrates how to code a binary search in python There is a sample binary search written in python A worksheet (x8 marks) of questions and answers on the binary search. A stretch and challenge exercise to identify errors and omissions in binary search code A plenary exercise (x8 questions) using a presentation to test what the pupils understand by a binary search (answers provided) A homework to rearrange lines of code to form a binary search

#### [GCSE+ IGCSE] End of Unit/topic Assessments for Computer Science

SET 1 of a few similar uploads 7 tests for different units Binary, Algorithms and Programming Each is separate with at least two for each unit. I use these as Part of my Y9 Computer Science course which leads students nicely into IGCSE Computer Science and GCSE Computer Science Basic Computer systems covering Hardware, ROM, Input devices etc Algorithms covering design of algorithms with pseudocode, flow charts etc and some trace tables Binary test, covering all areas except addition shifts and hex Programming tests covering conditonal loops, complex conditions, selection, repetition, inputs.

#### IGCSE Computer Science Paper 2: Applications of Computational Thinking

Mock example paper for Paper 2 of IGCSE Computer Science with Edexcel spec. This will be relevant for many exam boards (CIE will need to alter some of the pseduocode formatting) Also relevant for practise with GCSE for students Paper 2 with questions similar of reading and interpreting code, trace tables, flow charts etc Included in the Zip File is the 9 associated Python files which are required. Mail me for Marking Scheme when you have the resource.