Lesson Notes By Weeks and Term v4 - SHS 3
ELECTRONIC COMPONENTS AND CIRCUITS
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
ELECTRONIC COMPONENTS AND CIRCUITS
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
Subject: Applied Technology
Class: SHS 3
Term: 2nd Term
Week: 17
Grade code: 2.5.2.LI.8
Strand code: 4
Sub-strand code: 2
Content standard code: 2.5.2.CS.1
Indicator code: 2.5.2.LI.8
Theme: ELECTRICAL AND ELECTRONIC TECHNOLOGY
Subtheme: ELECTRONIC COMPONENTS AND CIRCUITS
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 the fundamental principles of Boolean Algebra, the mathematics that underpins all digital electronic systems. From the smartphones we use for mobile money and WhatsApp, to the traffic lights in Accra and Kumasi, to the computer systems that run our banks, all these technologies rely on millions of tiny electronic switches (transistors) that are either ON or OFF. Boolean Algebra provides a simple but powerful way to describe and simplify the logic that controls these switches. By learning to simplify complex Boolean expressions, we can design electronic circuits that are cheaper, faster, and more efficient.
2.1 What is Boolean Algebra?
Boolean Algebra is a type of algebra where the variables can only have two values: TRUE (represented by 1) or FALSE (represented by 0). 1 (HIGH): Represents a switch being ON, a voltage being present, or a statement being TRUE. 0 (LOW): Represents a switch being OFF, no voltage being present, or a statement being FALSE.
The main operations in Boolean Algebra correspond to the basic logic gates: AND (.) : The output is 1 only if ALL inputs are 1. (e.g., `A . B` or `AB`) OR (+) : The output is 1 if AT LEAST ONE input is 1. (e.g., `A + B`) NOT (') : The output is the inverse of the input. (e.g., `A'` or `Ā`) 2.2 The Fundamental Laws of Boolean Algebra
Just like in regular algebra, Boolean algebra has rules that help us manipulate and simplify expressions.