JHS1 Computing · Term 3 Week 10: Algorithm

Lesson notes

Learning Objectives

Indicator: B7.4.2.1.1 - Understand the use of sequence, selection and iteration in writing a programme. Describe the meanings of the term’s algorithm, decomposition and abstraction

By the end of the lesson, learners can:

Define algorithm, decomposition and abstraction in their own words with accurate examples.
Identify sequence, selection and iteration in a simple written programme or set of instructions.
Arrange daily activities or steps in a logical, linear order to demonstrate sequence.
Create a simple instruction set that uses selection (a choice between options) to reach the same outcome.
Write a short programme-like set of steps that repeats a block of instructions a set number of times (iteration).

Sign in with your phone number to read the full note and download the GES plan - free.

Sign in with phone number

Curriculum details

Strand: Computational Thinking (Strand 4)
Sub-strand: Algorithm (4.2)
Content standard: B7.4.2.1 - Analyse the correct step-by-step procedure in solving any real-world problem
Indicator: B7.4.2.1.1 - Understand the use of sequence, selection and iteration in writing a programme. Describe the meanings of the term's algorithm, decomposition and abstraction
Suggested placement: Term 3, Week 10 (Week 34 of the year)
Our suggestion, laid out in curriculum order across three terms of twelve weeks. NaCCA does not fix the week, so follow your school's scheme of learning.
Curriculum reference: Computing, Common Core Programme (JHS1-JHS3), 2023, p. 21
Transcribed from the official NaCCA publication. Check this page against the source.

Exemplars (from the NaCCA curriculum)

1. Write numbers (1-10) in an orderly arrangement to represent sequence. Write your itinerary for a day in a logical order (Sequence).
NB: The above should be linear with no branching statements.
2. Present a case study that has more than one option to choose from and still achieve the same outcome with any option chosen. For example, tea with or without sugar options can still meet a beverage outcome (selection).
2. Develop a solution to a problem which uses iteration to control the flow of the programme (iteration).
NB: Programs such as lightbot could be used for practical lessons.