Algorithm · JHS3 Computing

Lesson notes

Learning Objectives

Indicator: B9.4.2.1.1 - Write a programme using flowchart and Pseudocode algorithm that includes sequence, selection and iteration choices in problem-solving

By the end of the lesson, learners can:

Identify and explain the three control structures in algorithm design: sequence, selection, and iteration, with at least one example of each.
Analyse a real-world problem (such as proper hand-washing or preparing a beverage) and break it into correct step-by-step procedures.
Write a pseudocode algorithm that combines sequence, selection, and iteration to solve a given problem.
Draw a flowchart that correctly represents a pseudocode algorithm, using the standard symbols for start/end, process, decision, and flow lines.
Evaluate two different algorithms for the same task and justify which one is more efficient in terms of shorter execution time.

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: B9.4.2.1 - Analyse the Correct Step-by-step Procedure in Solving any Real-world Problem
Indicator: B9.4.2.1.1 - Write a programme using flowchart and Pseudocode algorithm that includes sequence, selection and iteration choices in problem-solving
Suggested placement: Term 3, Week 9 (Week 33 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. 54
Transcribed from the official NaCCA publication. Check this page against the source.

Exemplars (from the NaCCA curriculum)

1. Discuss at least three ways to do proper hand-washing and prepare beverages with or without sugar and/or milk.
2. Write an algorithm for Exemplar(s): 1 that focuses on procedure correctness and shortest time to execute.