SLR15 Boolean Algebra

Specification Points

1.4.3a Define problems using Boolean logic
1.4.3b Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions
1.4.3c Use the following rules to derive or simplify statements in Boolean algebra: De Morgan's Laws, distribution, association, commutation, double negation
1.4.3d Using logic gate diagrams and truth tables
1.4.3e The logic associated with D type flip flops, half and full adders

Student Learning Record

Exam Questions

SLR15 (AS & A) - Boolean algebra

Boolean_Algebra.pdf

15.1 Define Problems Using Boolean Logic

Supporting Video(s)

Learning Objectives

Define the term 'Boolean logic'
Apply Boolean logic to define real-world problems

Lesson Resources

Additional Links

15.2 Karnaugh Maps

Supporting Video(s)

Learning Objectives

Understand the need to simplify Boolean expressions
Describe the purpose of Karnaugh maps
Apply the use of Karnaugh maps to simplify Boolean expressions

Lesson Resources

Additional Links

15.3 Logic Gates and Truth Tables

Supporting Video(s)

Learning Objectives

Understand logic gates as the electronic implementation of Boolean logic
Describe how truth tables can show the behaviour of a logic circuit
Construct logic circuits based on Boolean expressions

Lesson Resources

Additional Links

Logic.ly logic circuit creation tool

15.4 (A-Level) Simplifying Statements in Boolean Algebra

Supporting Video(s)

Learning Objectives

Lesson Resources

Additional Links

15.5 (A-Level) D-Type Flip-Flops and Adders

Supporting Video(s)

Learning Objectives

Lesson Resources

Additional Links

Year 13 Recap Lesson

Report abuse