The presentation introduces x7 validation rules; range check, type check, presence check, length check, lookup check, picture check and check digit check. Each one of the descriptions is supported with an example written in python and these have been uploaded as separate text files as part of the resource.

The presentation introduces Reverse Polish Notation (postfix notation) and compares it to infix / prefix notation. There are examples of these different notations and then a closer look at how to convert expressions between postfix to infix and vice versa. A more detailed example demonstrates how a stack is used to temporarily manipulate values to evaluate the expression. Finally uses of RPN are given at the end of the presentation.

A presentation that introduces the different data flow diagram symbols, one by one and explains how a data flow diagram can be constructed from a table. An example of a data flow diagram is given followed a challenge exercise.

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

The logic gates AND, OR, NOT, NAND, NOR, XOR A Level Computer Science (24 slides) The AND, OR, NOT, NAND, NOR, XOR logic gate presentation covers the following: - Understanding that logic gates can be represented by switches as ON / OFF states - Understanding the different states that can be represented by logic gates - Understanding that logic gates can be represented by truth tables and Boolean expressions

TCP/IP Protocol Stack presentation: x13 slides The resource is for pupils studying GCSE and A level Computer Science and explains the four layers of the TCP / IP protocol stack; the application, the transpor, the network and the data link layers. The presentation includes: - an overview and explanation of the different layers - the protocols and some of the tasks involved in each layer - using an example of sending some data through the different layers - a summary at the end of the transmission of this data and how it has changed on it's journey

A presentation that describes what recursion is, uses two pseudo code examples (eg sum numbers and factorial) to illustrate the programming technique, including the importance of using a base condition and the result if no condition is used. There are a series of programming challenges at the end of the presentation.

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.

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.

How the Internet works presentation: x21 slides The following resource is mainly for advanced and A Level Computer Science pupils and explains some of the main characteristics about the Internet and how it works. It includes: - how Internet protocols (IP) are linked to domains - the way URLs are structured (eg top level, second level etc) in a hierarchy - role of ICANN - how domains are located using DNS - use of IPV4 / IPV6 - requesting a web page and the role of routers - use of packet switching and the makeup of individual packets - role of gateways in networks

The AND, OR, NOT logic gates (15 slides) GCSE & A Level Computer Science The AND, OR, NOT logic gate presentation covers the following: - Understanding that logic gates can be represented by switches as ON / OFF states - Understanding the different states that can be represented by logic gates - Understanding that logic gates can be represented by truth tables and Boolean expressions

Binary Addition Presentation (8 slides) GCSE & A Level Computer Science The Binary Addition presentation covers the following: - Comparing binary addition with denary addition - Understanding The rules of binary addition - Two practice questions

Binary Crossword Starter (word doc) - There are four questions down and four questions across. - The students have to guess the word, then convert the first letter of the word to binary using ASCII code. - There is a copy of the ASCII code the students can refer to convert letters to binary. - There is an answer document included with the resource. The students end with a crossword completed in binary using the ASCII code.

The presentation introduces five different data types; boolean, integer, real, date/time, string. Each slide describes the data type and gives examples of what they can represent.

The presentation describes what a stack data structure is, introduces the principle operations of PUSH / POP along with the stack pointer using simple, easy to understand diagrams. The presentation includes pseudo code for the PUSH / POP operations and describes three uses of the stack data structure.

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

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.

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