The presentation introduces the idea behind testing and covers the ideas behind the idea of creating a test plan, difference between a fault and an error and shows a blue screen error. It describes the importance of reliability, using different test data (typical, erroneous, exaggerated data) and how to formulate a test plan.

Lesson: Bubble sort, (lesson plan & 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 & 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)

There are three presentations one for each of the fetch, decode and execute cycles. The presentations outline what each stage does and defines each stage of each one of the processes. The three presentations are designed to be taught in the cycle order, so the pupils should have a full appreciation of what is happening once the fetch, decode and execute cycle has been completed.

Presentation on how a selection sort works. It includes: A presentation explaining the principle of operation behind a selection sort A presentation introducing the code written in python to perform a selection sort The selection sort python code in a separate text file.

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.

The presentation introduces the idea of data redundancy (repeating data) inside tables. It shows using clear diagrams how to avoid this by splitting a table into two separate tables and introducing a one to many relationship between these two tables. It goes onto show how to represent ‘many to many’ relationships using two ‘one to many’ relationships, before defining the two important keys; primary and foreign key. There is a word document worksheet where the pupils have to describe the relationships between entities.

The word document presents five questions asking for a translation from ‘infix’ to ‘postfix’ and five questions from ‘postfix’ to ‘infix’ notation. There is a question asking to convert a postfix expression into a binary tree and then requiring a traversal of the binary tree using preorder, post order and inorder traversal. There is a question asking about the purpose of RPN and another question asking why humans use infix notation and computers sometimes use postfix notation (x6 questions sub divided into sections)

AQA GCSE Computer Science: Unit 3.1 Booklet The x80 page booklet contains the following: the booklet is structured around the specification definitions of key concepts imaginative and practical explanations of key concepts flowchart and pseudocode examples of different programs examples of pseudocode and python programming coded snippets of the linear search, binary search and the bubble sort exercises to extend the nderstanding of these algorithms homeworks for pupils to complete The booklet can be used digitally or can be printed off for pupils to use as a workbook for this unit.

The trace table questions begin with some simple examples written in pseudocode, using that output variables in a WHILE / FOR loop and begin to introduce two WHILE / FOR loops, before introducing a one dimensional list and then a two dimensional list as the last question. The resource comes with ten questions on the worksheet and answers. The resource is suitable for any examination board.

GCSE Computer Science The resource includes a x7 page information sheet explaining procedures and functions, giving examples of both in pseudocode and python code for pupils to read and use as a reference resource. The resource also contains a separate x5 page worksheet containing x7 python programming questions on procedures and functions and an advanced question at the very end. The answers written in python code are included in a separate sheet along with x8 python coded examples (eg .py files)

The presentation introduces the idea of properties and methods belonging to a class, being able to instantiate a class and produce an object and how many objects can be created from the class. The presentation describes the OOP characteristics behind inheritance, encapsulation and polymorphism. It gives six supporting examples using python code to demonstrate the above concepts. At the end of the presentation there is a challenge to create a program to illustrate the new ideas. This is supported by a class diagram that displays the relationship between the classes.

The lesson on computer networks is appropriate for KS3 and GCSE standard. Lesson plan outlining the structure of the lesson. Starter asking pupils to build a computer network using network components (answers included). Presentation on the advantages / disadvantages of computer networks. Reference to an external video on computer networks. Reference to an external computer network simulation Worksheet requiring pupils to give a definition, example and a diagram of PAN, LAN, WAN computer networks. Presentation on PAN, LAN, Wan describing each kind of network. Stretch & challenge activity, research into WIFI networks sheet Plenary true or false presentation Homework to make a video explaining the different types of computer network

Lesson: Linear search, (lesson plan & x 10 resources) (GCSE Computer Science) • To understand and explain how a linear search works An easy to follow and timed lesson plan (x1 hour) that includes x10 resources. Starter activity where pupils line up and hold numbers up to simulate a linear search. A linear search presentation that introduces and explains the search algorithm with supporting examples given in python Three linear search programs written in python, demonstrating a linear search (basic), a linear search (when data item not found) and a linear search (when more than one item you are looking for is found) Pupils view a simulation of a linear search (Internet link provided) A worksheet of six questions and answers on the linear search. A stretch and challenge exercise to program a linear search that counts the number of search terms if there is more than one search term. A plenary exercise to read through an account of visiting a games store and searching for a particular game. The parts of the account that are in error have to be highlighted in red. A research homework exercise and answers about the linear search (x3 questions)