# The Computer Room

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

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

29Uploads

2k+Views

875Downloads

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!

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

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

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

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

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

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.

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

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)

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

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.

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.

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

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

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.