Lesson Notes By Weeks and Term v4 - SHS 2
DIGITAL ELECTRONICS
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
DIGITAL ELECTRONICS
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
Subject: Physics
Class: SHS 2
Term: 2nd Term
Week: 14
Grade code: 2.3.3.LI.3
Strand code: 3
Sub-strand code: 3
Content standard code: 2.3.3.CS.2
Indicator code: 2.3.3.LI.3
Theme: ELECTRIC FIELD, MAGNETIC FIELD AND ELECTRONICS
Subtheme: DIGITAL ELECTRONICS
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.
This lesson introduces a fundamental method for describing the logic of digital circuits: the Sum of Products (SOP). Digital devices are everywhere in our lives in Ghana, from the smartphones we use for Mobile Money (MoMo) and WhatsApp, to the traffic lights in Accra and Kumasi, and the digital displays at the filling station. All these devices make decisions based on simple 'ON' or 'OFF' signals (represented by 1 and 0). Boolean algebra is the mathematics we use to describe this logic, and the Sum of Products is a straightforward way to translate a desired outcome (from a truth table) into a mathematical expression that can be built into a circuit.
Part 1: Quick Review of Basic Logic Gates and Boolean Notation
Before we build complex expressions, let's remember the basic building blocks. In Boolean algebra, we use variables (like A, B, C) that can only have two values: 1 (HIGH, ON, TRUE) or 0 (LOW, OFF, FALSE). NOT Gate (Inverter): Function: Inverts the input. If input A is 1, output is 0. If A is 0, output is 1. Boolean Expression: The output X is written as `X = Ā` (read as "A-bar" or "NOT A"). Symbol: `¬A` or `A'` are also used. We will stick to `Ā`. AND Gate: Function: Output is 1 only if ALL inputs are 1. Think of it as multiplication. Boolean Expression: The output X for inputs A and B is `X = A.B` or simply `X = AB`. Example: `1 . 1 = 1`, but `1 . 0 = 0` and `0 . 0 = 0`. OR Gate: Function: Output is 1 if AT LEAST ONE input is 1. Think of it as addition. Boolean Expression: The output X for inputs A and B is `X = A + B`. Example: `1 + 0 = 1`, `1 + 1 = 1`, but `0 + 0 = 0`.
| Gate | Boolean Expression | Analogy | | :--- | :--- | :--- | | NOT | `Ā` | The opposite of the input. | | AND | `A.B` | You need your keys AND your wallet to leave. | | OR | `A + B` | You can pay with cash OR MoMo. |
Part 2: What is "Sum of Products" (SOP)?