Lesson Notes By Weeks and Term v4 - SHS 1
Higher Order Design Thinking
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
Higher Order Design Thinking
Download the Lessonotes Mobile Ghana app for faster lesson access on Android and iPhone.
Subject: Robotics
Class: SHS 1
Term: 2nd Term
Week: 10
Grade code: 1.3.1.LI.2
Strand code: 3
Sub-strand code: 1
Content standard code: 1.3.1.CS.1
Indicator code: 1.3.1.LI.2
Theme: Robot Construction & Programming
Subtheme: Higher Order Design Thinking
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 foundational planning tools used in robotics and computer programming. Before we can build a robot or write a single line of code, we must first have a clear, logical plan. This plan helps us think through a problem step-by-step, ensuring our final robot behaves exactly as we intend. In Ghana, as we embrace more technology in sectors like agriculture, healthcare, and finance (like Mobile Money), understanding how to design logical solutions is a critical skill for our future innovators. This lesson provides the mental tools—algorithms, pseudocode, and flowcharts—to create these solutions.
Introduction: Why Plan Before You Build?
Imagine you want to cook a perfect pot of Jollof rice for your family. Do you just start throwing ingredients into a pot? No! You follow a recipe. You know the steps: wash the rice, blend tomatoes and peppers, fry onions, add tomato paste, add seasoning, etc. If you miss a step or do them in the wrong order, you might end up with burnt or soggy rice.
In robotics, our "recipe" is our plan. Building a robot without a plan leads to errors, frustration, and a robot that doesn't work. The three main tools for creating this plan are Algorithms, Pseudocode, and Flowcharts. Concept 1: Algorithm Definition: An algorithm is a finite, step-by-step sequence of instructions designed to solve a specific problem or perform a specific task. Think of it as a detailed recipe. Characteristics of a Good Algorithm: Unambiguous: Each step must be clear and have only one interpretation. Finite: It must have a clear stopping point. It cannot go on forever. Input: It takes some value(s) as input. Output: It produces a clear result or output. Effective: Each instruction must be simple enough that it can be carried out in practice. Ghanaian Context Example: Sending Mobile Money Let's break down the process of a user sending money via MoMo into a simple algorithm. Problem: Send GHS 50 to a friend. Algorithm: Start. Dial the MoMo short code (*170#). Select 'Transfer Money'. Select 'MoMo User'. Enter the recipient's phone number. Confirm the recipient's phone number. Enter the amount (GHS 50). Enter a reference. Enter your PIN to authorise. Wait for confirmation message. End.
This is a perfect example of an algorithm. It's a clear, step-by-step process that leads to a specific outcome. Robotics Example: A Simple Line-Following Robot Problem: Make a robot move forward until it detects a black line, then stop. Algorithm: Start the robot's program. Turn the motors on to move forward. Continuously check the colour sensor. If the sensor sees a black line, proceed to step 5. Otherwise, go back to step 3. Turn the motors off. End the program. Concept 2: Pseudocode Definition: Pseudocode (meaning "false code") is a way of writing out an algorithm using a simplified, human-readable notation. It is a bridge between plain English and a real programming language (like Python or C++). It has some structure and keywords but isn't as strict as a programming language. Common Keywords: `START`, `END` `INPUT`, `GET`, `READ` (for receiving data) `OUTPUT`, `DISPLAY`, `PRINT` (for showing data) `IF...THEN...ELSE...ENDIF` (for making decisions) `WHILE...ENDWHILE` or `FOR...ENDFOR` (for loops/repetition) `SET`, `CALCULATE` (for processing) Robotics Example: Line-Following Robot (in Pseudocode) Let's convert our algorithm from before into pseudocode.