Lesson Notes By Weeks and Term v4 - Basic 5

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

• Define programming and databases.
• Identify the basic parts of a computer program.
• Create a simple program plan using pseudocode.
• Explain what a database is and how it's used.
• Design a simple database structure.

Lesson summary

This lesson introduces learners to the concept of algorithms. An algorithm is simply a set of clear, step-by-step instructions for solving a problem or completing a task. We use algorithms every day in Ghana without even thinking about it! When we follow a recipe to cook Jollof rice, give a friend directions to our house, or follow the steps to send money with a mobile phone, we are using an algorithm. Understanding how to create and follow algorithms is the first and most important step in learning how to communicate with computers, which is what programming is all about.

Lesson notes

What is an Algorithm?

An algorithm is a list of well-defined, step-by-step instructions for solving a problem or completing a task. Think of it like a recipe from a cookbook. A Recipe for Banku: To prepare banku, you must follow specific steps in a specific order. You mix the corn and cassava dough, add water, stir on the fire, and so on. If you change the order of the steps (e.g., put it on the fire before adding water), you will not get banku. An algorithm is just like that recipe – the steps must be clear and in the correct order. Computers Need Algorithms: Computers are very powerful, but they are not smart on their own. They need us to give them very precise instructions for everything they do. These instructions form an algorithm. When a programmer writes code, they are just translating an algorithm into a language the computer can understand. Characteristics of a Good Algorithm

A good algorithm must have these qualities: Clear and Unambiguous: Each step must be very clear and have only one meaning. "Walk down the road" is not clear. "Walk 50 metres straight ahead" is much clearer. Ordered: The steps must be in the correct sequence. Finite: It must have a clear starting point and a clear ending point. It should not go on forever. Correct: It must successfully solve the problem it was designed for. Ways to Represent an Algorithm

We can write algorithms in different ways. Today, we will focus on the simplest way: using plain language.