• Free
  • CBSE Class 9 Mathematics
  • 6 lessons
  • About 1 h 47 min

Chapter 11 The World of Algorithms: Foundation

Chapter 11 of the NCERT Class 9 Mathematics textbook (Ganita Manjari Part II), explained step by step with worked examples, diagrams, practice questions and revision notes.

About this course

Chapter 11 of the NCERT Class 9 Mathematics textbook (Ganita Manjari Part II), explained step by step with worked examples, diagrams, practice questions and revision notes.

What you will learn, lesson by lesson

  1. What an algorithm is: column addition step by step Describe an algorithm as a precise list of basic steps, follow the column addition algorithm with carries exactly as written, explain why it gives the right sum, and see why it is far faster than counting.
  2. Listing the divisors of a number: names, lists and tracing Write the algorithm that lists the divisors of a number, execute it step by step while tracking a list, and use it to build a test for whether a number is prime.
  3. The greatest common divisor: a first algorithm and improvements Write a gcd algorithm straight from the definition using lists of divisors, then improve it step by step and count how much work each version does.
  4. Euclid's subtraction algorithm for the gcd Explain why gcd(m, n) = gcd(n, m − n), run Euclid's subtraction algorithm with its stopping rule, and see why it can still be slow when one number is much smaller than the other.
  5. Āryabhaṭa's division method and what makes a good algorithm Replace repeated subtraction by the remainder (m mod n), find the gcd quickly by the long-division method, explain why it is correct, and summarise the ideas of algorithms, from basic steps to efficiency.
  6. Final self-assessment: The World of Algorithms Test yourself on the whole course: 15 questions with answers explained.

Lessons in this course

  1. 1 What an algorithm is: column addition step by step About 15 min Start
  2. 2 Listing the divisors of a number: names, lists and tracing About 15 min Start
  3. 3 The greatest common divisor: a first algorithm and improvements About 16 min Start
  4. 4 Euclid's subtraction algorithm for the gcd About 15 min Start
  5. 5 Āryabhaṭa's division method and what makes a good algorithm About 16 min Start
  6. 6 Final self-assessment: The World of Algorithms About 30 min Start

Questions about this course

Is this course free?

Yes. Every lesson in this course is free to read.

How do I keep track of what I've finished?

Create a free account and sign in. Each lesson you finish is saved to your account and shown here and on your dashboard.

Student reviews

No reviews yet. Students who finish a lesson can rate this course.

Keep going

Privacy · Terms · Refunds · Delivery