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)

Dijkstra’s Algorithm Presentation contains x20 slides going through how the algorithm works using a series of six numbered steps. There is a worksheet with two questions (answers provided) for pupils to work through after they have viewed the presentation.

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.

Procedures Presentation (x8 slides) A presentation on how procedures work, look at the advantages of using procedures and two examples of procedures written in python and some exercises on the last slide. Functions Presentation (x9 slides) A presentation on how functions work, compares procedures to functions, comments on the advantages of using functions, two examples of functions written in python and some exercises on the last slide.

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.

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

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 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)

The revision guide could form the basis of a revision guide at Key stage 3 and could be enhanced to include other topics. The revision guide covers the following IT topics: Hardware Software Input devices Storage media Output devices Modems Networking Spreadsheets Databases

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

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)

Lesson: Binary search, (lesson plan & 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

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)

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.

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 presentation introduces the terms database, relationship, table, records, fields and data items to explain the structure of a database. It gives visual examples of these terms and relates them to a database hierarchy. It explains the different degrees of relationships and asks a question to label a table database structure. The resource also includes a follow on worksheet where the pupils drag and drop database definitions alongside each one of the database terms.

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.