Grade 10 Information Technology · Lesson 6.4
Algorithm Representation
Unit 6: Fundamentals of Programming
An algorithm can be written down, or represented, in several ways. The most common are natural language, pseudocode, flowcharts and, finally, a programming language. Each has strengths for different purposes, and programmers often use more than one.
Key terms
- Natural language
- algorithm written in ordinary sentences
- Pseudocode
- structured English-like code
- Flowchart
- diagram of an algorithm with standard symbols
- Connector
- symbol joining parts of a flowchart
- Decision table
- conditions and resulting actions
- Trace table
- tracking variable values step by step
Summary
- Algorithms can be represented in natural language, pseudocode, flowcharts or code.
- Pseudocode is precise yet language-independent.
- Flowcharts show control flow visually; trace tables test algorithms.
In everyday life: Ethiopian Electric Utility technicians follow flowchart-style fault-finding guides to decide step by step why a transformer has failed.
Check yourself
- Give one advantage and one disadvantage of flowcharts.
- Write pseudocode that inputs age and outputs 'Adult' if age ≥ 18.
- What is a trace table used for?
Practice questions
1. Writing an algorithm in structured, English-like statements is called:
- A. Pseudocode
- B. Machine code
- C. Binary
- D. HTML
Show answer
Answer: Pseudocode
Pseudocode looks like code but ignores strict syntax, so it is easy to read and later translate into any language.
On WeLearn
The full lesson: reading notes, worked examples, class activities and the Unit 6 quiz
Study Algorithm Representation on WeLearnTeach Algorithm Representation with WeLearn
We will bring a demo to your school: a lesson on your interactive TV, a virtual lab and a classroom game, with your own teachers.
