Lesson Notes By Weeks and Term v4 - SHS 3

Lesson Video

This page supports the lesson note with a companion video and a short classroom-ready summary.

For class groups and homework, share this lesson page so learners also get the summary, objectives, and full lesson context.

Performance objectives

• Identify key electronic components and their functions.
• Understand series and parallel circuit configurations.
• Apply Boolean algebra to solve circuit-related problems.
• Analyze and troubleshoot basic electronic circuits.

Lesson summary

Good morning, learners. Today, we are diving into a topic that is the secret language of all the digital devices we use every day – from our smartphones and laptops to the traffic lights on our roads and even the systems that run Mobile Money (MoMo) transactions. This language is called Boolean Algebra. It might sound complex, but it's a very simple and powerful system of logic that deals with just two values: TRUE or FALSE. By understanding Boolean Algebra, we can understand how computers "think" and how to design simple, efficient digital circuits. This knowledge is fundamental for anyone interested in electronics, computer science, and engineering.

Lesson notes

*(Teacher’s Note: This section should be taught interactively, using the board to write down definitions, rules, and examples. Encourage learners to ask questions at every stage.)* What is Boolean Algebra? Named after the mathematician George Boole, Boolean Algebra is the mathematics of logic. In the world of electronics, we don't work with an infinite range of numbers. Instead, we work with two states: ON (represented by the number 1 or the state TRUE) OFF (represented by the number 0 or the state FALSE)

Think of a simple light switch. It can only be ON or OFF. Boolean Algebra gives us the tools to work with these two states. Focal Area 1: Elements of Boolean Algebra The elements are very simple: The Set: The values a Boolean variable can have is `{0, 1}`. Variables: These are letters (like A, B, C, X, Y) used to represent a logical statement or the input/output of a circuit. For example, `A` could represent "The door is open." So, if the door is actually open, `A = 1`. If it's closed, `A = 0`. Operators: These are the symbols that perform logical operations. The three basic ones are AND, OR, and NOT. Focal Area 2: Operations or Functions of Boolean Algebra The NOT Operation (Inversion or Complement) Symbol: A bar over the variable (`Ā`) or an apostrophe (`A'`). Meaning: It inverts the value. If A is TRUE (1), then A' is FALSE (0). If A is FALSE (0), then A' is TRUE (1). Analogy: If `A` is "It is raining," then `A'` is "It is NOT raining." Truth Table: | A | A' | |---|---| | 0 | 1 | | 1 | 0 | The AND Operation (Conjunction) Symbol: A dot (`.`) or just writing variables together (e.g., `A.B` or `AB`). Meaning: The output is TRUE (1) only if ALL inputs are TRUE (1). Analogy: Think of two light switches connected in series to a bulb. For the bulb to light up, *both* Switch A AND Switch B must be ON. Truth Table: | A | B | A.B | |---|---|-----| | 0 | 0 | 0 | | 0 | 1 | 0 | | 1 | 0 | 0 | | 1 | 1 | 1 | The OR Operation (Disjunction) Symbol: A plus sign (`+`) (e.g., `A + B`). Meaning: The output is TRUE (1) if at least ONE of the inputs is TRUE (1). Analogy: Think of two light switches connected in parallel to a bulb. The bulb will light up if Switch A is ON, OR Switch B is ON, OR both are ON. It's only OFF if both are OFF. Truth Table: | A | B | A+B | |---|---|-----| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 1 | Focal Area 3 & 4: Basic Rules and Axioms of Boolean Algebra

*(Teacher’s Note: Present these as fundamental laws that help us simplify complex expressions. Encourage learners to form mixed-ability groups to discuss and try to come up with analogies for each rule before you explain it formally. This aligns with the NaCCA pedagogy.)*

These rules are used to manipulate and simplify Boolean expressions, just like how we use rules in regular algebra.

Evaluation guide

• Solve problems on Boolean Algebra
• Focal Are a:
• Elements of Boolean algebra
• Operations or functions of Boolean algebra