Lesson Notes By Weeks and Term v4 - SHS 2

DATA STORAGE AND MANIPULATION

Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.

Subject: Computing

Class: SHS 2

Term: 1st Term

Week: 3

Grade code: 2.1.1.LI.2

Strand code: 1

Sub-strand code: 1

Content standard code: 2.1.1.CS.1

Indicator code: 2.1.1.LI.2

Theme: COMPUTER ARCHITECTURE & ORGANISATION

Subtheme: DATA STORAGE AND MANIPULATION

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

Lesson summary

In today's world of smartphones, laptops, and digital devices, we all want things to be faster, smaller, and cheaper. But have you ever wondered how engineers achieve this? Deep inside every computer processor and digital device are millions of tiny electronic switches connected in circuits. The way these circuits are designed determines how efficiently the device works. Today, we will learn the "language" of these circuits—Boolean Algebra. By mastering this, we can take a complicated, slow, and expensive circuit and simplify it into a much more efficient one. This is like taking a long, winding road from Madina to Circle and finding a direct, shorter route.

Lesson notes

A. Recap: Logic Gates and Boolean Variables

Before we simplify, let's remember our basic building blocks: Logic Gates: Electronic circuits that perform a logical operation on one or more inputs to produce a single output. AND Gate: Output is 1 only if all inputs are 1. (Symbol: `.` or no symbol, e.g., `A.B` or `AB`) OR Gate: Output is 1 if at least one input is 1. (Symbol: `+`, e.g., `A+B`) NOT Gate: Inverts the input. A 1 becomes a 0, and a 0 becomes a 1. (Symbol: `'` or `¯`, e.g., `A'` or `Ā`) Boolean Variables: Letters (like A, B, C) that can only have two values: 1 (True/ON) or 0 (False/OFF). B. What is Boolean Algebra?

Boolean Algebra is the mathematics we use to analyse and simplify digital logic circuits. It provides a set of rules and laws to manipulate Boolean expressions. C. The Laws of Boolean Algebra

These are our tools for simplification. You must become very familiar with them.

Evaluation guide