Information Processing — Class 8 Maths (Samacheer Kalvi)
TN State Board (Samacheer Kalvi) Class 8 Mathematics, Chapter 7 (the final chapter). Thinking systematically to count and organise.
1. About this chapter
This chapter develops logical and computational thinking — systematic counting, the principle of counting, tree diagrams, and step-by-step (algorithmic) methods for solving puzzles.
2. Systematic and repeated counting
- List possibilities in an organised way so that none is missed and none is repeated.
- Repeated counting (iteration) applies the same step again and again until the task is complete.
3. Principle of counting
- Rule of product: if one task can be done in m ways and another in n ways, then both together can be done in m × n ways.
- Tree diagrams show all the possible choices branch by branch.
4. Algorithmic thinking
- An algorithm is a clear, step-by-step procedure to solve a problem (used in packing, shortest-route and arrangement puzzles).
- Breaking a problem into ordered steps makes it easier and avoids mistakes.
5. Worked examples
Example 1. A girl has 3 shirts and 2 skirts. How many different outfits can she make? By the rule of product: 3 × 2 = 6 outfits.
Example 2. How many 2-digit numbers can be formed using the digits 1, 2, 3 (repetition allowed)? 3 × 3 = 9 numbers.
Example 3. Why use a tree diagram? To list all possibilities clearly so that none is missed.
6. Common mistakes
- Mistake: Counting some possibilities twice. Fix: Count systematically (in order) so nothing repeats.
- Mistake: Adding instead of multiplying choices. Fix: For independent choices, multiply (rule of product).
- Mistake: Skipping steps in a procedure. Fix: Follow the algorithm step by step.
7. Practice (book-back style)
- State the rule of product (principle of counting).
- A menu has 4 starters and 3 main dishes. How many starter–main combinations are there?
- How many 2-digit numbers can be formed from 5, 6, 7 (repetition allowed)?
- What is a tree diagram used for?
- What is an algorithm?
8. Answer key
- If one task can be done in m ways and another in n ways, both can be done in m × n ways.
- 4 × 3 = 12 combinations.
- 3 × 3 = 9 numbers.
- To list all possible outcomes clearly so none is missed.
- A clear, step-by-step procedure to solve a problem.
9. Quick revision
- Chapter 7 (final) · systematic counting, principle of counting, algorithms.
- Count systematically — none missed, none repeated.
- Rule of product: m ways × n ways = m × n ways.
- Tree diagrams list all possibilities.
- Algorithms solve problems step by step.
