Lesson Notes By Weeks and Term v4 - JHS 3
ALGORITHM
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
ALGORITHM
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
Subject: Computing
Class: JHS 3
Term: 3rd Term
Week: 9
Grade code: B9.4.2.1.1
Strand code: 4
Sub-strand code: 2
Content standard code: B9.4.2.1
Indicator code: B9.4.2.1.1
Theme: COMPUTATIONAL THINKING
Subtheme: ALGORITHM
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.
Algorithms are the foundation of all computing. They are not just for computers; we use them every day in our lives here in Ghana. A recipe for preparing *jollof rice*, the steps for withdrawing money from a Mobile Money (MoMo) agent, or giving a friend directions from the market to your house are all examples of algorithms. In this lesson, we will learn how to formally plan these step-by-step instructions using two important tools: Pseudocode (written instructions in a simple, English-like format) and Flowcharts (diagrams that show the flow of instructions). Mastering these tools is the first and most important step to becoming a programmer.
A. What is an Algorithm? An algorithm is a clear, finite, step-by-step set of instructions designed to solve a specific problem or perform a task. Think of it as a detailed recipe.
Characteristics of a Good Algorithm: Unambiguous: Each step must be clear and have only one meaning. There should be no confusion. Input: An algorithm should have zero or more well-defined inputs (the data it needs to work with). Output: An algorithm must have one or more well-defined outputs. It must produce a result. Finiteness: An algorithm must end after a finite number of steps. It cannot go on forever. Effectiveness: Every instruction must be basic enough to be carried out, in principle, by a person using only a pencil and paper.
Example: Algorithm for Preparing Instant Noodles START Boil water in a pot. Add the noodles to the boiling water. Add the seasoning sachet. Stir for 2 minutes. Serve in a bowl. END
This is a simple, clear, and finite set of instructions. Now, let's learn how to represent such instructions for a computer. B. Tool 1: Pseudocode Pseudocode (pronounced "soo-doh-code") means "fake code." It is a way of writing out an algorithm using simple English-like statements before we write it in an actual programming language like Python or C++. It has no strict rules but follows a general structure.