Teach Computing

Revision notes, activities, lesson plans, teaching ideas, and other resources for GCSE, A-Level, and IB Computer Science teachers and students.

What's New

UK Computing Laws

This video from Computer Science Tutor covers the main UK computing laws re...

Wireless Networking (Wi-Fi, Security, and Hardware)

This video about wireless networking includes everything that is needed for...

Network topology videos

These four excellent videos from Computer Science tutor cover the four ma...

Network protocols

These four videos explain the main networking protocols that students are l...

Embedded Systems video

This short video is a good over of embedded systems, covering the main poin...

Representing Text in Binary

This video clearly explains the two main ways of representing text in binar...

Types of Malware

This video explains the various types of malware including viruses and troj...

Protecting against Malware

Following on from the Types of Malware video, this video explains technique...

Video: Network Security #1

This video gives an overview of the threats to networked computer systems, ...

Resources discount offer

3.3 Hardware

Click here for recommended Cambridge A-Level Computer Science textbooks.

3.3.1 Logic gates and circuit design

Half-Adder

XOR and Half-Adder

This video starts by recapping the truth table for an exclusive-OR (XOR) gate, and then goes on to show how its properties can be used to help create a half-adder in conjunction with an AND gate. The video helps demystify the concept by building up the half-adder and explaining with examples why an additional gate is needed.


Updated: 2015-04-29

3.3.2 Boolean algebra

Boolean expression simplification

Logic Simplification Examples Using Boolean Rules

This is an excellent video which goes clearly through the individual steps of simplifying Boolean expressions. The video starts with a clear list of simplification rules and explains why they work. There are then two examples, complete with logic circuit diagrams, which are worked through line by line until they are fully simplified. This is probably the clearest explanation of Boolean simplification I have seen. (The video is a lot better than the screenshot makes it look!)


Updated: 2015-11-24

3.3.3 Karnaugh Maps

3.3.4 Flip-flops

3.3.5 RISC processors

3.3.6 Parallel processing

CERN Grid Computing

CERN Grid Computing system

This brief tour of the CERN computer grid gives a good overview of the computing system and the power available.

The second video features interviews with CERN employees who explain how the grid computing system works and how the data is transmitted to and processed by multiple tiers of computers spread across Europe.


Updated: 2015-05-27