Year 8 Mathematics · AC9M8SP04

Algorithms for Congruence and Similarity

Turn geometric criteria into an ordered decision process, trace it with examples, deliberately test edge cases and debug any branch that misclassifies congruent or…

Ready to project and teach

Key conceptTeach from the board

An algorithm is an explicit sequence of steps and decisions. For geometric classification, every decision must ask about measurable or stated criteria, not appearance.

A good flowchart separates outcomes such as congruent, similar but not congruent, not established and insufficient information. It should not force a classification when the data are inadequate.

Testing means more than confirming easy examples. Include rotated/reflected shapes, scale factor 1, non-unit scale factors, mismatched correspondence, AAA cases, SSA traps and near-matches that should be rejected.

Preserve the full AC9 elaboration sequence: list criteria, convert triangle congruence/similarity conditions into a sorting algorithm such as a flow chart, then evaluate the algorithm for accuracy and explain how it works.

Worked examplesWe do

Worked examples

AC9M8SP04 - Algorithms for Congruence and Similarity
Example 1

List the criteria your algorithm needs for SSS, SAS and AAA.

Example 2

Create a branch distinguishing congruent from similar-but-not-congruent triangles.

Example 3

Trace a 3-4-5 triangle against a 6-8-10 triangle.

Example 4

Test a case with insufficient information and choose an appropriate output.

Curriculum examplesCopied content

Australian Curriculum v9.0 — AC9M8SP04: design, create and test algorithms involving sequences of steps and decisions that identify congruency or similarity, and describe how the algorithm works.

Victorian Curriculum F–10 Version 2.0 — Level 8, VC2M8SP04:Exact.

NSW Mathematics K–10 Syllabus (2022) — Stage 4, MA4-GEO-C-01; MAO-WM-01:Partial. NSW Stage 4 geometry and Working mathematically supply classification/reasoning content, but there is no single Stage 4 outcome mirroring the national geometric-algorithm requirement.

LessonAC v9VictoriaNSW
Geometric algorithmsAC9M8SP04VC2M8SP04 — ExactMA4-GEO-C-01; MAO-WM-01 — Partial
Questions and answersWith answers
  1. What makes a geometric algorithm reliable? Explicit valid criteria, correct correspondence and tests covering success and failure cases.
  2. Why include insufficient information? Some data do not justify either conclusion.
  3. What is debugging? Finding which step/condition causes an incorrect output and repairing it.
  4. Why test near-matches? They reveal overly broad criteria that accept shapes they should reject.
Practice and reviewReady for practice
  • An algorithm should always return yes/no. Sometimes the correct result is insufficient information.
  • Passing one test case proves correctness. Test contrasting and boundary cases designed to expose faults.
  • Correspondence can be ignored. Wrong vertex matching can produce false ratios or angle comparisons.
  • A flowchart is only presentation. Branch order and conditions change the mathematical output.
Curriculum alignmentStart here
Related resourcesKeep teaching
Teach & ExplainTeaching slides and samples

Teach this topic step by step

Explore optional teaching slide packs for classroom lessons and explanations at home.

Browse Teach & Explain · Browse Print & Go

Teachers: follow SkillrHub on TPT, then email us to request a free sample before buying. Include the year, subject and topic or curriculum code.

Request a free sample

After trying the sample, honest feedback is welcome. A TPT review is optional, where available, and does not need to be positive.