Grade 10 Information Technology · Lesson 6.3
Characteristics of an Algorithm
Unit 6: Fundamentals of Programming
Not every list of instructions is a good algorithm. Computer scientists usually require an algorithm to have five essential characteristics: input, output, definiteness, finiteness and effectiveness. Checking these helps you find mistakes before you start coding.
Key terms
- Input
- data the algorithm receives
- Output
- result the algorithm produces
- Definiteness
- each step has one clear meaning
- Finiteness
- the algorithm stops after finite steps
- Effectiveness
- each step is basic and feasible
- Generality
- works for a class of inputs
- Infinite loop
- a loop that never ends
Summary
- The five characteristics: input, output, definiteness, finiteness, effectiveness.
- Infinite loops break finiteness; vague steps break definiteness.
- Good algorithms are also correct, general, efficient and clear.
In everyday life: A recipe card for injera that says 'add some water' lacks definiteness, which is why different people get different results; precise measures fix this.
Check yourself
- List the five characteristics of an algorithm.
- What is an infinite loop?
- Why must every step be effective?
Practice questions
1. Which characteristic means an algorithm must stop after a limited number of steps?
- A. Finiteness
- B. Input
- C. Generality
- D. Colour
Show answer
Answer: Finiteness
An algorithm that never ends cannot give an answer, so finiteness is required.
2. True or false: Each step of an algorithm should have only one possible meaning.
Show answer
Answer: True
This is definiteness: unclear steps could be carried out differently by different people or machines.
On WeLearn
The full lesson: reading notes, worked examples, class activities and the Unit 6 quiz
Study Characteristics of an Algorithm on WeLearnTeach Characteristics of an Algorithm 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.
