# Teenage Cancer Trust - all resources to go towards charity!

I am a Head of Computer Science and I have been teaching for 16 years in five different schools. I enjoy creating resources for young people and I hope you enjoy them!

Home feed

My list

Courses
My Jobs
Job alerts
My CV
Career preferences
Resources
Author dashboard
Settings

Edit account
Log out
I am a Head of Computer Science and I have been teaching for 16 years in five different schools. I enjoy creating resources for young people and I hope you enjoy them!

34Uploads

11k+Views

6k+Downloads

I am a Head of Computer Science and I have been teaching for 16 years in five different schools. I enjoy creating resources for young people and I hope you enjoy them!

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

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.

Bundle

Lessons (x1 hour) on linear and binary searches and logic gate presentation
GCSE Computer Science.
Starter activities
Presentation on linear and binary searches
View simulations of both searches
Worksheet questions
Stretch & challenge activities
Plenary
Homeworks
(Logic gate presentation included)

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.

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

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.

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)

Bundle

Includes the following x1 hour lessons:
linear search
binary search
bubble sort
merge sort
Format of the lessons:
Starter activities
Presentations
Simulations
Worksheets
Stretch & challenge activities
Plenary assessment
Homeworks

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

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