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

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.

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.

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

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.

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.

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.

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.

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.

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)