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

CommandPoint CAD

CommandPoint by Northrop Grumman offers a range of CAD systems for various ...

CAD+911 System

TriTech Software Systems is a company that specialises in Computer Aided Di...

London Ambulance CAD failure

The 1992 London Ambulance Service CAD failure is probably the most notoriou...

Washington State 911 Failure

A 911 emergency telephone system in Washington State and Oregon shut down f...

London ambulance failure (2017)

A 2017 failure of a London ambulance dispatch system is believed to have le...

Computer Aided Dispatch outage

A 911 system failure left emergency calls unanswered and is said to have co...

Load balancing videos

This short article and the associated video explain 5 load balancing algori...

Intergraph Computer-Aided Dispatch (I/CAD

Intergraph Computer-Aided Dispatch (I/CAD) is a system offering many of the...

Boolean logic worksheet pack

These three Boolean logic worksheets have exam style questions on logic sta...

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