JHS1 Computing · Term 3 Week 11: Algorithm

Lesson notes

Indicator: B7.4.2.1.2 - Perform a linear search

By the end of the lesson, learners can:

Define linear search as a step-by-step method for locating a value in a list by checking each item in order.
Perform a linear search on a list of up to 10 values to locate a target value and state its position.
Report that a target is not found when it does not appear anywhere in the list.
Practise the same checking procedure on unordered lists and arrange given values in increasing and decreasing order to support searching.

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

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.2 - Perform a linear search
Suggested placement: Term 3, Week 11 (Week 35 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.

1. Locate a given value position out of listed values.
2. Arrange some given values or data in increasing and decreasing order.