Boolean Algebra (Cambridge (CIE) A Level Computer Science): Revision Note

Exam code: 9618

Robert Hampton

Written by: Robert Hampton

Reviewed by: James Woodhouse

Updated on

Boolean algebra

What is Boolean algebra?

  • Boolean algebra is a mathematical system used to manipulate Boolean values

  • Complex expressions can be made simpler using the rules of Boolean algebra

  • This is a more powerful simplification method than Karnaugh maps and can simplify expressions that Karnaugh maps cannot

  • There are various different rules that you need to learn and that can then be applied to certain expressions to simplify them

  • Combining these rules can mean that complex expressions can be reduced to much simpler ones

General rules

  • General AND rules

    • X AND 0 = 0

    • X AND 1 = X

    • X AND A = X

    • NOT X AND X = 0

  • Note, the value ox X is unknown and it is used as a placeholder

  • Therefore X AND 1 = X means that the output will be whatever the value of X is

  • General OR rules

    • X OR 0 = X
      X OR 1 = 1
      X OR A = X
      NOT X OR X = 1

Boolean algebra notation

  • In Boolean algebra, expressions are written using shorthand notation:

Symbol

Meaning

Example

Explanation

A · B or AB

AND

A · B

True only if both A and B are 1

A + B

OR

A + B

True if either A or B is 1

¬A or A'

NOT / complement

¬A

True if A is 0, False if A is 1

( )

Brackets / grouping

(A + B)·C

Do A OR B first, then AND with C

Examiner Tips and Tricks

A dot (·) for AND is often omitted, so AB means A AND B

  • A line drawn above a variable or expression means that the value is inverted or negated

  • It's the NOT of that value

Notation

Meaning

Explanation

¬A or A' or

NOT A

True if A is False, False if A is True

A · B̅

A AND (NOT B)

B is negated before the AND operation

(A + B)̅

NOT (A OR B)

The entire OR expression is negated (use De Morgan)

(A · B · C)̅

NOT (A AND B AND C)

All values are ANDed together, then the result is negated

  • When you see multiple horizontal lines, for example:

Three Boolean expressions: (A.B), (A.C), (B.D) each with an overline indicating negation, displayed as digital logic notation.
  • It means the whole expression is negated, not just one part

  • Always apply De Morgan’s Law starting with the outermost line first

De Morgan's Law

What is De Morgan’s Law?

  • De Morgan’s Laws are used to simplify Boolean expressions involving negation of conjunctions (AND) or disjunctions (OR)

  • They are particularly useful for rewriting logic circuits using only NAND or NOR gates

  • There are two key rules:

    1. NOT (A AND B) is equivalent to (NOT A) OR (NOT B)

      stack A. space B with bar on top equals A with bar on top plus B with bar on top

    2. NOT (A OR B) is equivalent to (NOT A) AND (NOT B)

      stack A space plus space B with bar on top equals top enclose A space. space top enclose B

Worked example 1: Simplify ¬(A ∧ B)

Step

Explanation

Expression

Step 1

Start with the original expression

top enclose A space. space B end enclose

Step 2

Apply De Morgan’s Law: change ∧ to ∨ and negate both terms

top enclose A plus top enclose B

Step 3

Remove unnecessary brackets

top enclose A plus top enclose B

Worked example 2: Simplify ¬(A ∨ B)

Step

Explanation

Expression

Step 1

Start with the original expression

top enclose A plus B end enclose

Step 2

Apply De Morgan’s Law: change ∨ to ∧ and negate both terms

top enclose A. top enclose B

Step 3

Remove unnecessary brackets

top enclose A. top enclose B

Why use De Morgan’s Laws?

  • Simplifying Boolean expressions using De Morgan’s Laws:

    • Allows for implementation using only NAND or NOR gates

    • Makes circuit design more efficient and cost-effective

    • Is essential in hardware where NAND/NOR logic is cheaper or faster to implement

    • Is commonly used in microprocessor and memory device design (e.g. flash drives)

Worked Example

Simplify the following expression using Boolean algebra, including De Morgan’s laws. Show your working.[3]

Boolean logic expression with horizontal lines above (A.B), (A.C), and (B.D), indicating logical negation of the operations inside brackets.

Answer

  • Correct application of De Morgan’s Law [1 mark]

  • Correct application of Double Negation Law or Distributive Law [1 mark]

  • Correct answer [1 mark]

Boolean expression showing logical transformations: top row negating (A.B).(A.C).(B.D); resulting in A̅.(B̅ + C) + B.D [1].

You've read 0 of your 5 free revision notes this week

Unlock more, it's free!

Join the 100,000+ Students that ❤️ Save My Exams

the (exam) results speak for themselves:

Did this page help you?

Robert Hampton

Author: Robert Hampton

Expertise: Computer Science Content Creator

Rob has over 16 years' experience teaching Computer Science and ICT at KS3 & GCSE levels. Rob has demonstrated strong leadership as Head of Department since 2012 and previously supported teacher development as a Specialist Leader of Education, empowering departments to excel in Computer Science. Beyond his tech expertise, Robert embraces the virtual world as an avid gamer, conquering digital battlefields when he's not coding.

James Woodhouse

Reviewer: James Woodhouse

Expertise: Computer Science & English Subject Lead

James graduated from the University of Sunderland with a degree in ICT and Computing education. He has over 14 years of experience both teaching and leading in Computer Science, specialising in teaching GCSE and A-level. James has held various leadership roles, including Head of Computer Science and coordinator positions for Key Stage 3 and Key Stage 4. James has a keen interest in networking security and technologies aimed at preventing security breaches.