Unit Overview

Hardware

CIE A-Level Computer Science· 5 min read 📊 n/a

1. Unit at a Glance

This unit follows a logical build from the smallest building blocks of digital computing up to full hardware systems. We start with core binary logic, then move to simplifying logic circuits, before shifting to full system architecture and peripheral hardware. All topics build incrementally: logic gates are required for Boolean algebra, which is the foundation for Karnaugh maps, and all logic concepts underpin our study of whole computer hardware.

This unit is split into the following sub-topics:

Logic gates

Learn the function, symbols and truth tables for all standard logic gates and combined logic circuits.

★★⏱ 10 min

Boolean algebra

Master Boolean laws, identities and techniques for manipulating and simplifying Boolean expressions.

★★★⏱ 12 min

Karnaugh maps

Use K-maps to visually simplify 2, 3 and 4 variable Boolean expressions including don't care conditions.

★★★★⏱ 15 min

Computer architecture

Explore Von Neumann and Harvard architectures, and core components including the CPU, memory and buses.

★★⏱ 10 min

Input and output devices

Classify, compare and evaluate different input and output peripherals for different real-world use cases.

★⏱ 8 min

Secondary storage

Understand the characteristics, advantages and disadvantages of all common secondary storage technologies.

★⏱ 7 min

2. Common Pitfalls

Wrong move:

Forgetting to invert both operands and the operator when applying De Morgan's laws.

Why:

This is a common mistake that leads to incorrect simplified Boolean expressions.

Correct move:

Always apply De Morgan's rule step-by-step, and verify your final expression with a quick truth table check.

Wrong move:

Mixing up the key differences between Von Neumann and Harvard architecture.

Why:

Both models share core components, so it is easy to confuse their memory structures.

Correct move:

Remember: Von Neumann = one shared memory for instructions and data; Harvard = separate memories for instructions and data.

3. Quick Reference Cheatsheet

Concept	Key Details
AND Gate Output	$Q = A \cdot B$ (output is 1 only if both inputs are 1)
OR Gate Output	$Q = A + B$ (output is 1 if any input is 1)
De Morgan's First Law	$\overline{A \cdot B} = \overline{A} + \overline{B}$
De Morgan's Second Law	$\overline{A + B} = \overline{A} \cdot \overline{B}$
K-map Group Rule	Groups must be size $2^{n}$ (1, 2, 4, 8...) and can wrap around grid edges
Von Neumann Architecture	Single shared memory and bus for data and instructions
Harvard Architecture	Separate physical memories and buses for data and instructions
SSD Key Property	Non-volatile, no moving parts, faster random access than magnetic HDD

What's Next

Now that you have an overview of the Hardware unit, start with the first sub-topic, Logic Gates, which introduces the fundamental building blocks of all digital systems. Work through sub-topics in order, as each topic builds directly on knowledge from the previous one. Once you complete all sub-topics in this unit, you will move on to the next unit covering Software for CIE A-Level Computer Science.