JHS3 Computing · Term 3, Week 10

Algorithm

Lesson notes

Learning Objectives

Indicator: B9.4.2.1.2 - Translate a Flowchart algorithm to Pseudocode format and vice versa

By the end of the lesson, learners can:

  1. Identify the key components of a flowchart (start/end, process, decision, input/output, arrows) and match them to their equivalent Pseudocode statements.
  2. Translate a given flowchart algorithm into correct Pseudocode format, using keywords like START, INPUT, PROCESS, IF…THEN…ELSE, and STOP.
  3. Convert a given Pseudocode algorithm into a flowchart format, arranging the correct shapes and arrows in the proper order.
  4. Check that a translated algorithm (flowchart to Pseudocode or vice versa) preserves the same logic and produces the same outcome as the original.
  5. Justify their choice of Pseudocode keywords or flowchart symbols when translating between the two formats.

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.2 - Translate a Flowchart algorithm to Pseudocode format and vice versa
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. 54

Transcribed from the official NaCCA publication. Check this page against the source.

Exemplars (from the NaCCA curriculum)

1. Write an algorithm using flowchart format. Convert or translate the same flowchart algorithm into a Pseudocode format. (do a vice versa translation example to reinforce critical thinking)