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.

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.

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.

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)

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.

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.

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.

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.

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

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

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.

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

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

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