TM
New NCERT textbook · Class 9 Maths

Ganita Manjari, period by period — fitted to your timetable.

Tell Meyy your periods and their length; it plans every chapter of Ganita Manjari to fit, and you tick off sections as you teach.

Chapter 11 · Period 1 of 14 · 50 min

From Dot-Counting to Column Addition — What Is an Algorithm

Adding Numbers · Problem solving

This unit opens the chapter's two guiding questions — what an algorithm is and why mathematics cares about it — using addition as the vehicle; no prior chapter content is assumed beyond familiarity with the Indian base-ten place-value system. Watch for students who treat the column method as 'just the way you add' without seeing it as a procedure whose steps could be written down and examined. The comparison of growth rates (dots versus columns as number size increases) is the key intuition this unit plants.

0-10Open with the question: how would you add 5 and 7 by drawing dots? Then ask: what if the two numbers were 473 and 695? Students estimate how many dots they would need and share their intuition about why dot-counting becomes impractical. Record responses on the board.
10-25Introduce the column method for 473 + 695 on the board: write the numbers one below the other with digits aligned from the right, then add column by column from right to left, showing the carry at each step. Students copy the layout and follow the working column by column, noting where the carry arises and where it does not.
25-40Place both approaches side by side on the board — the dot picture and the column — and ask students to articulate in pairs why the column method is faster. Draw out the idea that the column method is a systematic, step-by-step procedure: the chapter's central concept of an algorithm is named here. Students write one sentence defining, in their own words, what they understand an algorithm to be.
40-50Whole-class share-out of student definitions. Teacher consolidates: an algorithm is a step-by-step procedure stated precisely enough that each step can be carried out without ambiguity. Connect this framing to the chapter's opening questions — what an algorithm is and what it has to do with mathematics.
Assessment

Competency (C-9.2). Following and analysing sequences of instructions — executing algorithms step by step, tracing their behaviour, and comparing how work grows with input size.

Learning outcome. Students can contrast the dot-counting method with the column addition method and identify the column method as a systematic step-by-step procedure for adding large numbers.

To add 2847 and 5316 using the dot-counting method, you would draw 2847 dots, then 5316 more dots, and count all of them. To add the same pair using the column method, you write the numbers one below the other, aligned from the right, and add column by column. Which statement best explains why the column method is more practical for large numbers?

  • A Dot-counting requires carrying, whereas the column method does not.
  • B The column method always gives a different answer from dot-counting, so it must be checked separately.
  • C The column method only works when both numbers have the same number of digits.
  • D The number of column additions grows by one for each extra digit, while the number of dots to draw and count grows tenfold for each extra digit.

D. The number of column additions grows by one for each extra digit, while the number of dots to draw and count grows tenfold for each extra digit.

What each wrong option reveals

  • A Reverses the carrying relationship — carrying arises in the column method (when a column sum reaches 10) and is absent from simple dot-counting.
  • B Confuses the two methods as producing different results — a misconception about correctness rather than efficiency; the column method gives the same sum as dot-counting.
  • C Misidentifies a condition for the column method — the method works for numbers with any number of digits, including mismatched lengths, by treating absent digits as zero.
Chapter 11 · 14 periods of 50 min

Also saved as 8 periods or 11 periods.

  • 2Writing and Justifying the Five-Step Addition Algorithm
    Adding Numbers Digit by Digit
  • 3Introducing the GCD Problem and the Divisors Algorithm
    Greatest Common Divisor
  • 4Executing the Divisors Algorithm — Lists and Systematic Checking
    Computing the Divisors of a Number
  • 5Comparing Divisor Lists to Find the GCD
    Finding the Greatest Common Divisor
  • 6The First Complete GCD Algorithm — Writing and Executing It
    First Algorithm for gcd
  • 7Data Structures — Names That Make Algorithms Concise
    Data Structures
  • 8Three Refinements — From Two Scans to a Single Variable
    Improving the Algorithm
  • 9Correctness and Efficiency — Why These Algorithms Still Fall Short
    Analysing these Algorithms
  • 10Euclid's Key Observation — Proving gcd(m,n) = gcd(n, m−n)
    Euclid's Subtraction Algorithm
  • 11Euclid's Algorithm — Execution, Efficiency Limit, and the Need for a Better Step
    Euclid's Subtraction Algorithm
  • 12Āryabhaṭa's Division Algorithm — Remainder Replaces Repeated Subtraction
    Āryabhaṭa's Division Algorithm
  • 13Verifying the Remainder Reduction and Tracing the Word 'Algorithm'
    Āryabhaṭa's Division Algorithm
  • 14Synthesis — Algorithms, Efficiency, and Mathematical Justification Across the Chapter
    Synthesis
Ganita Manjari · Class 9 · 14 chapters

Any 3 chapters free · no payment details · then introductory offer ₹499 per subject-stage, per year.