Current Affairs updated daily
KalviGavaniKalviGavani
Class 8 · Tamil Nadu State Board

Information Processing Exercise Solutions | KalviGavani

Samacheer Kalvi 8th Maths Information Processing exercise solutions with MCQs, fill in blanks, true or false, match the following, short and detailed answers, common mistakes, and exam checklist.

Updated 12 June 202633 min read

How to Use This Page

Use this page alongside your Samacheer Kalvi Class 8 Maths textbook. Attempt every exercise question on your own first, then check the step-by-step solutions below. Focus on understanding the method, not just the final answer.

Key Concepts (Quick Recap)

Set Notation

  • Element: An object in a set. If 3 is in set A, we write 3 is an element of A.
  • Subset: If every element of B is also in A, then B is a subset of A (B is a subset of A).
  • Universal set (U): The set containing all elements under consideration.
  • Empty set: A set with no elements, denoted by empty set or {}.
  • Cardinal number n(A): The number of elements in set A.

Set Operations

  • Union (A union B): All elements in A or B or both.
  • Intersection (A intersection B): Elements common to both A and B.
  • Difference (A - B): Elements in A but not in B.
  • Complement (A'): Elements in the universal set U but not in A.

Key Formula

n(A union B) = n(A) + n(B) - n(A intersection B)

Venn Diagram Representation

  • A rectangle represents the universal set U.
  • Circles inside the rectangle represent subsets.
  • Overlapping regions show intersections.
  • The region outside a circle but inside the rectangle shows the complement.

De Morgan's Laws

1. (A union B)' = A' intersection B' 2. (A intersection B)' = A' union B'

Binary Number System

  • Base 2 system using digits 0 and 1 only.
  • Each position represents a power of 2: ... 2^3, 2^2, 2^1, 2^0.
  • Binary to decimal: Multiply each digit by its place value and add.

Flowchart Symbols

SymbolShapePurpose
TerminatorOvalStart / End
Input/OutputParallelogramRead data / Print result
ProcessRectangleCalculation or action
DecisionDiamondYes/No question

Exercise 7.1 — Sets and Venn Diagrams

1. Write the following sets in roster form.

(a) A = {x : x is a natural number less than 6}

A = {1, 2, 3, 4, 5}

Natural numbers start from 1. Numbers less than 6 are 1, 2, 3, 4, 5.

(b) B = {x : x is a vowel in the English alphabet}

B = {a, e, i, o, u}

The vowels in English are a, e, i, o, u.

(c) C = {x : x is an even number between 3 and 11}

C = {4, 6, 8, 10}

Even numbers between 3 and 11 (excluding 3 and 11): 4, 6, 8, 10.

2. Write the following sets in set-builder form.

(a) A = {2, 4, 6, 8, 10}

A = {x : x is an even natural number less than or equal to 10}

(b) B = {1, 4, 9, 16, 25}

B = {x : x = n squared, where n is a natural number from 1 to 5}

These are the squares of 1, 2, 3, 4, 5.

(c) C = {Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday}

C = {x : x is a day of the week}

3. Identify whether the following are finite or infinite sets.

(a) A = {x : x is a natural number}

Infinite set. Natural numbers go on forever: 1, 2, 3, ...

(b) B = {x : x is a prime number less than 20}

Finite set. There are finitely many primes less than 20: {2, 3, 5, 7, 11, 13, 17, 19}.

(c) C = {x : x is a multiple of 5}

Infinite set. Multiples of 5 go on forever: 5, 10, 15, 20, ...

4. If A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}, find A intersection B.

A intersection B = {3, 4, 5}

Elements common to both A and B are 3, 4, and 5.

5. If A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}, find A union B.

A union B = {1, 2, 3, 4, 5, 6, 7}

All elements that are in A or B or both.

6. If U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} and A = {2, 4, 6, 8}, find A'.

A' = {1, 3, 5, 7, 9, 10}

A' contains all elements in U that are not in A.

7. Draw a Venn diagram for two sets A and B where A = {1, 2, 3, 4} and B = {3, 4, 5, 6}. Show the regions.

Venn diagram description:

+-------------------------------------------+ | U | | | | +-------+ +-------+ | | | 1 | 3 | | | | | 2 | , 4 | 5 | | | | | | 6 | | | +-------+-------+-------+ | | A only A int B B only | +-------------------------------------------+ A only region: {1, 2} A intersection B: {3, 4} B only region: {5, 6}

8. If A = {a, b, c, d} and B = {c, d, e, f}, find:

(a) A - B

A - B = {a, b}

Elements in A but not in B.

(b) B - A

B - A = {e, f}

Elements in B but not in A.

9. If n(A) = 12, n(B) = 18, and n(A intersection B) = 5, find n(A union B).

n(A union B) = n(A) + n(B) - n(A intersection B) = 12 + 18 - 5 = 25

10. If n(A) = 15, n(B) = 20, n(A union B) = 28, find n(A intersection B).

n(A union B) = n(A) + n(B) - n(A intersection B) 28 = 15 + 20 - n(A intersection B) 28 = 35 - n(A intersection B) n(A intersection B) = 35 - 28 = 7

11. In a class of 40 students, 25 like Maths and 20 like Science. If 10 students like both subjects, how many students like at least one subject?

Let A = students who like Maths Let B = students who like Science n(A) = 25, n(B) = 20, n(A intersection B) = 10 n(A union B) = n(A) + n(B) - n(A intersection B) = 25 + 20 - 10 = 35 35 students like at least one subject.

12. In a class of 40 students, 25 like Maths and 20 like Science. If 10 students like both, how many like neither?

n(A union B) = 35 (from previous question) Neither = n(U) - n(A union B) = 40 - 35 = 5 5 students like neither Maths nor Science.

13. If U = {1, 2, 3, 4, 5, 6, 7, 8} and A = {1, 3, 5, 7}, verify that A union A' = U.

A' = {2, 4, 6, 8} A union A' = {1, 3, 5, 7} union {2, 4, 6, 8} = {1, 2, 3, 4, 5, 6, 7, 8} = U (Verified)

14. If U = {1, 2, 3, 4, 5, 6, 7, 8} and A = {1, 3, 5, 7}, verify that A intersection A' = empty set.

A' = {2, 4, 6, 8} A intersection A' = {1, 3, 5, 7} intersection {2, 4, 6, 8} = {} (no common elements) = empty set (Verified)

15. In a group of 50 people, 30 speak Tamil and 25 speak English. If each person speaks at least one language, how many speak both?

Since everyone speaks at least one language: n(A union B) = n(U) = 50 n(A intersection B) = n(A) + n(B) - n(A union B) = 30 + 25 - 50 = 5 5 people speak both Tamil and English.

16. Draw a Venn diagram for three sets A, B, C where A = {1, 2, 3, 4}, B = {3, 4, 5, 6}, C = {4, 5, 6, 7}. Show all regions.

Venn diagram description:

+--------------------------------------------+ | U | | | | A only: {1, 2} | | B only: {6} (in B but not in A or C) | | C only: {7} | | A intersection B only: {} | | A intersection C only: {} | | B intersection C only: {5} | | A intersection B intersection C: {4} | | A intersection B (not C): {3} | +--------------------------------------------+ Region details: - A only = {1, 2} - A intersection B only = {3} - A intersection B intersection C = {4} - B intersection C only = {5} - C only = {7} - Note: 6 is in both B and C but the question lists it in B only relative to the three-set overlap; actually 6 is in B intersection C.

17. If A = {1, 2, 3} and B = {3, 4, 5}, find (A union B)' given U = {1, 2, 3, 4, 5, 6, 7}.

A union B = {1, 2, 3, 4, 5} (A union B)' = U - (A union B) = {6, 7}

18. If A = {1, 2, 3} and B = {3, 4, 5}, find (A intersection B)' given U = {1, 2, 3, 4, 5, 6, 7}.

A intersection B = {3} (A intersection B)' = U - {3} = {1, 2, 4, 5, 6, 7}

19. State whether the following pairs of sets are equal or not.

(a) A = {1, 2, 3} and B = {3, 2, 1}

Equal. The order of elements does not matter in a set.

(b) A = {x : x is a letter in "CAT"} and B = {C, A, T}

Equal. A = {C, A, T} and B = {C, A, T}. Same elements.

(c) A = {1, 2, 3} and B = {{1}, 2, 3}

Not equal. In B, {1} is a set (not the element 1), so the elements differ.

20. Identify the subsets. If A = {a, b, c}, list all subsets.

Subsets of A = {a, b, c}: {}, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c} Total number of subsets = 2^3 = 8

Exercise 7.2 — Set Operations and Properties

1. Verify the commutative property: A union B = B union A for A = {1, 2, 3} and B = {3, 4, 5}.

A union B = {1, 2, 3} union {3, 4, 5} = {1, 2, 3, 4, 5} B union A = {3, 4, 5} union {1, 2, 3} = {1, 2, 3, 4, 5} A union B = B union A (Verified)

2. Verify the commutative property: A intersection B = B intersection A for A = {1, 2, 3} and B = {3, 4, 5}.

A intersection B = {1, 2, 3} intersection {3, 4, 5} = {3} B intersection A = {3, 4, 5} intersection {1, 2, 3} = {3} A intersection B = B intersection A (Verified)

3. Verify the associative property: (A union B) union C = A union (B union C) for A = {1, 2}, B = {2, 3}, C = {3, 4}.

Step 1: A union B = {1, 2} union {2, 3} = {1, 2, 3} (A union B) union C = {1, 2, 3} union {3, 4} = {1, 2, 3, 4} Step 2: B union C = {2, 3} union {3, 4} = {2, 3, 4} A union (B union C) = {1, 2} union {2, 3, 4} = {1, 2, 3, 4} (A union B) union C = A union (B union C) = {1, 2, 3, 4} (Verified)

4. Verify the associative property: (A intersection B) intersection C = A intersection (B intersection C) for A = {1, 2, 3}, B = {2, 3, 4}, C = {3, 4, 5}.

Step 1: A intersection B = {1, 2, 3} intersection {2, 3, 4} = {2, 3} (A intersection B) intersection C = {2, 3} intersection {3, 4, 5} = {3} Step 2: B intersection C = {2, 3, 4} intersection {3, 4, 5} = {3, 4} A intersection (B intersection C) = {1, 2, 3} intersection {3, 4} = {3} (A intersection B) intersection C = A intersection (B intersection C) = {3} (Verified)

5. Verify the distributive property: A intersection (B union C) = (A intersection B) union (A intersection C) for A = {1, 2, 3, 4}, B = {2, 4, 6}, C = {3, 4, 5}.

Step 1: B union C = {2, 4, 6} union {3, 4, 5} = {2, 3, 4, 5, 6} A intersection (B union C) = {1, 2, 3, 4} intersection {2, 3, 4, 5, 6} = {2, 3, 4} Step 2: A intersection B = {1, 2, 3, 4} intersection {2, 4, 6} = {2, 4} A intersection C = {1, 2, 3, 4} intersection {3, 4, 5} = {3, 4} (A intersection B) union (A intersection C) = {2, 4} union {3, 4} = {2, 3, 4} Both sides = {2, 3, 4} (Verified)

6. Verify De Morgan's Law: (A union B)' = A' intersection B' for U = {1, 2, 3, 4, 5, 6, 7, 8}, A = {1, 2, 3, 4}, B = {3, 4, 5, 6}.

Step 1: A union B = {1, 2, 3, 4} union {3, 4, 5, 6} = {1, 2, 3, 4, 5, 6} (A union B)' = U - (A union B) = {7, 8} Step 2: A' = U - A = {5, 6, 7, 8} B' = U - B = {1, 2, 7, 8} A' intersection B' = {5, 6, 7, 8} intersection {1, 2, 7, 8} = {7, 8} (A union B)' = A' intersection B' = {7, 8} (Verified)

7. Verify De Morgan's Law: (A intersection B)' = A' union B' for U = {1, 2, 3, 4, 5, 6, 7, 8}, A = {1, 2, 3, 4}, B = {3, 4, 5, 6}.

Step 1: A intersection B = {1, 2, 3, 4} intersection {3, 4, 5, 6} = {3, 4} (A intersection B)' = U - {3, 4} = {1, 2, 5, 6, 7, 8} Step 2: A' = {5, 6, 7, 8} B' = {1, 2, 7, 8} A' union B' = {5, 6, 7, 8} union {1, 2, 7, 8} = {1, 2, 5, 6, 7, 8} (A intersection B)' = A' union B' = {1, 2, 5, 6, 7, 8} (Verified)

8. If A = {1, 2, 3, 4, 5}, B = {4, 5, 6, 7, 8}, U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, find:

(a) A'

A' = U - A = {6, 7, 8, 9, 10}

(b) B'

B' = U - B = {1, 2, 3, 9, 10}

(c) A' intersection B'

A' intersection B' = {6, 7, 8, 9, 10} intersection {1, 2, 3, 9, 10} = {9, 10}

(d) A' union B'

A' union B' = {6, 7, 8, 9, 10} union {1, 2, 3, 9, 10} = {1, 2, 3, 6, 7, 8, 9, 10}

9. In a survey of 100 students, 60 like cricket, 50 like football, and 30 like both. Find:

(a) How many like at least one game?

n(C union F) = n(C) + n(F) - n(C intersection F) = 60 + 50 - 30 = 80 80 students like at least one game.

(b) How many like only cricket?

Only cricket = n(C) - n(C intersection F) = 60 - 30 = 30

(c) How many like only football?

Only football = n(F) - n(C intersection F) = 50 - 30 = 20

(d) How many like neither?

Neither = n(U) - n(C union F) = 100 - 80 = 20

10. In a school, 40 students play hockey, 45 play basketball, and 20 play both. If each student plays at least one game and there are 80 students in total, find how many play only hockey.

Only hockey = n(H) - n(H intersection B) = 40 - 20 = 20 20 students play only hockey.

11. If n(A) = 20, n(B) = 30, n(A intersection B) = 8, find n(A - B).

A - B = Elements in A but not in B n(A - B) = n(A) - n(A intersection B) = 20 - 8 = 12

12. If n(A) = 20, n(B) = 30, n(A intersection B) = 8, find n(B - A).

B - A = Elements in B but not in A n(B - A) = n(B) - n(A intersection B) = 30 - 8 = 22

13. Verify: n(A union B) = n(A - B) + n(A intersection B) + n(B - A) using A = {1, 2, 3, 4, 5}, B = {4, 5, 6, 7}.

A intersection B = {4, 5} A - B = {1, 2, 3} B - A = {6, 7} n(A - B) = 3 n(A intersection B) = 2 n(B - A) = 2 n(A union B) = n(A - B) + n(A intersection B) + n(B - A) = 3 + 2 + 2 = 7 Check: A union B = {1, 2, 3, 4, 5, 6, 7}, n(A union B) = 7 (Verified)

14. In a town, 70% of people read Tamil newspaper, 50% read English newspaper, and 30% read both. What percentage reads at least one newspaper?

n(T union E) = n(T) + n(E) - n(T intersection E) = 70 + 50 - 30 = 90 90% of people read at least one newspaper.

15. If A is a subset of B, show that A intersection B = A.

If A is a subset of B, every element of A is also in B. A intersection B = elements common to both A and B. Since all elements of A are already in B, the common elements are exactly the elements of A. Therefore A intersection B = A. (Verified) Example: A = {1, 2}, B = {1, 2, 3, 4} A intersection B = {1, 2} intersection {1, 2, 3, 4} = {1, 2} = A

16. If A is a subset of B, show that A union B = B.

If A is a subset of B, every element of A is already in B. A union B = all elements in A or B or both. Since A is already contained in B, adding A adds nothing new. Therefore A union B = B. (Verified) Example: A = {1, 2}, B = {1, 2, 3, 4} A union B = {1, 2} union {1, 2, 3, 4} = {1, 2, 3, 4} = B

17. Find the number of subsets of A = {a, b, c, d}.

Number of elements in A = 4 Number of subsets = 2^4 = 16 Subsets: {}, {a}, {b}, {c}, {d}, {a,b}, {a,c}, {a,d}, {b,c}, {b,d}, {c,d}, {a,b,c}, {a,b,d}, {a,c,d}, {b,c,d}, {a,b,c,d}

18. If U = {1, 2, 3, ..., 10}, A = {2, 4, 6, 8, 10}, B = {1, 3, 5, 7, 9}, find A intersection B.

A = even numbers from 1 to 10 B = odd numbers from 1 to 10 A intersection B = {} (empty set) Even and odd numbers have no common elements.

19. If A and B are disjoint sets with n(A) = 15 and n(B) = 20, find n(A union B).

Disjoint sets: A intersection B = empty set, so n(A intersection B) = 0 n(A union B) = n(A) + n(B) - n(A intersection B) = 15 + 20 - 0 = 35

20. If n(A union B) = 50, n(A intersection B) = 10, n(A - B) = 20, find n(B).

n(A) = n(A - B) + n(A intersection B) = 20 + 10 = 30 n(A union B) = n(A) + n(B) - n(A intersection B) 50 = 30 + n(B) - 10 50 = 20 + n(B) n(B) = 30

Exercise 7.3 — Number Systems and Conversions

1. Convert the following binary numbers to decimal.

(a) 101

101 (binary) = 1 times 2^2 + 0 times 2^1 + 1 times 2^0 = 4 + 0 + 1 = 5 (decimal)

(b) 1101

1101 (binary) = 1 times 2^3 + 1 times 2^2 + 0 times 2^1 + 1 times 2^0 = 8 + 4 + 0 + 1 = 13 (decimal)

(c) 11010

11010 (binary) = 1 times 2^4 + 1 times 2^3 + 0 times 2^2 + 1 times 2^1 + 0 times 2^0 = 16 + 8 + 0 + 2 + 0 = 26 (decimal)

(d) 11111

11111 (binary) = 1 times 2^4 + 1 times 2^3 + 1 times 2^2 + 1 times 2^1 + 1 times 2^0 = 16 + 8 + 4 + 2 + 1 = 31 (decimal)

(e) 100000

100000 (binary) = 1 times 2^5 + 0 times 2^4 + 0 times 2^3 + 0 times 2^2 + 0 times 2^1 + 0 times 2^0 = 32 + 0 + 0 + 0 + 0 + 0 = 32 (decimal)

2. Convert the following decimal numbers to binary.

(a) 7

7 / 2 = 3 remainder 1 3 / 2 = 1 remainder 1 1 / 2 = 0 remainder 1 Read remainders from bottom to top: 111 7 (decimal) = 111 (binary)

(b) 15

15 / 2 = 7 remainder 1 7 / 2 = 3 remainder 1 3 / 2 = 1 remainder 1 1 / 2 = 0 remainder 1 Read remainders from bottom to top: 1111 15 (decimal) = 1111 (binary)

(c) 25

25 / 2 = 12 remainder 1 12 / 2 = 6 remainder 0 6 / 2 = 3 remainder 0 3 / 2 = 1 remainder 1 1 / 2 = 0 remainder 1 Read remainders from bottom to top: 11001 25 (decimal) = 11001 (binary)

(d) 50

50 / 2 = 25 remainder 0 25 / 2 = 12 remainder 1 12 / 2 = 6 remainder 0 6 / 2 = 3 remainder 0 3 / 2 = 1 remainder 1 1 / 2 = 0 remainder 1 Read remainders from bottom to top: 110010 50 (decimal) = 110010 (binary)

(e) 100

100 / 2 = 50 remainder 0 50 / 2 = 25 remainder 0 25 / 2 = 12 remainder 1 12 / 2 = 6 remainder 0 6 / 2 = 3 remainder 0 3 / 2 = 1 remainder 1 1 / 2 = 0 remainder 1 Read remainders from bottom to top: 1100100 100 (decimal) = 1100100 (binary)

3. Add the following binary numbers.

(a) 101 + 110

101 + 110 ----- 1011 Step by step: Rightmost: 1 + 0 = 1 Middle: 0 + 1 = 1 Left: 1 + 1 = 10 (write 0, carry 1) Carry: 1 Answer: 1011

(b) 1101 + 1011

1101 + 1011 ------ 11000 Step by step: Rightmost: 1 + 1 = 10 (write 0, carry 1) Next: 0 + 1 + 1 (carry) = 10 (write 0, carry 1) Next: 1 + 0 + 1 (carry) = 10 (write 0, carry 1) Leftmost: 1 + 1 + 1 (carry) = 11 (write 11) Answer: 11000

(c) 111 + 111

111 + 111 ----- 1110 Step by step: Rightmost: 1 + 1 = 10 (write 0, carry 1) Next: 1 + 1 + 1 (carry) = 11 (write 1, carry 1) Leftmost: 1 + 1 + 1 (carry) = 11 (write 11) Answer: 1110

4. Convert the following decimal numbers to binary and verify by converting back.

(a) 10

Decimal to binary: 10 / 2 = 5 remainder 0 5 / 2 = 2 remainder 1 2 / 2 = 1 remainder 0 1 / 2 = 0 remainder 1 Binary: 1010 Verification (binary to decimal): 1010 = 1 times 2^3 + 0 times 2^2 + 1 times 2^1 + 0 times 2^0 = 8 + 0 + 2 + 0 = 10 (Verified)

(b) 20

Decimal to binary: 20 / 2 = 10 remainder 0 10 / 2 = 5 remainder 0 5 / 2 = 2 remainder 1 2 / 2 = 1 remainder 0 1 / 2 = 0 remainder 1 Binary: 10100 Verification: 10100 = 1 times 2^4 + 0 times 2^3 + 1 times 2^2 + 0 times 2^1 + 0 times 2^0 = 16 + 0 + 4 + 0 + 0 = 20 (Verified)

5. Subtract the following binary numbers.

(a) 1101 - 101

1101 - 101 ------ 1000 Step by step: Rightmost: 1 - 1 = 0 Next: 0 - 0 = 0 Next: 1 - 1 = 0 Leftmost: 1 - 0 = 1 Answer: 1000

(b) 10110 - 1101

10110 - 1101 ------- 1001 Using borrowing: Rightmost: 0 - 1: borrow, 10 - 1 = 1 Next: 0 - 0 - 1 (borrow) = -1: borrow, 10 - 0 - 1 = 1 Next: 1 - 1 - 1 (borrow) = -1: borrow, 10 - 1 - 1 = 0 Next: 0 - 1 - 1 (borrow): borrow, 10 - 1 - 1 = 0 Leftmost: 0 (after borrowing) = 0 Answer: 01001 = 1001

6. What is the place value of the digit 1 in the binary number 10110?

Binary number: 1 0 1 1 0 Position: 4 3 2 1 0 (power of 2) The digit 1 appears at positions 4, 2, and 1. Position 4: 1 times 2^4 = 16 Position 2: 1 times 2^2 = 4 Position 1: 1 times 2^1 = 2 The leftmost 1 has place value 2^4 = 16.

7. How many different symbols are used in the binary system? Name them.

The binary system uses 2 symbols: 0 and 1. These are the only digits in base 2.

8. Write the decimal equivalent of the binary number 10101.

10101 (binary): = 1 times 2^4 + 0 times 2^3 + 1 times 2^2 + 0 times 2^1 + 1 times 2^0 = 16 + 0 + 4 + 0 + 1 = 21 (decimal)

9. Convert decimal 35 to binary.

35 / 2 = 17 remainder 1 17 / 2 = 8 remainder 1 8 / 2 = 4 remainder 0 4 / 2 = 2 remainder 0 2 / 2 = 1 remainder 0 1 / 2 = 0 remainder 1 Read remainders from bottom to top: 100011 35 (decimal) = 100011 (binary)

10. Which is larger: binary 10000 or decimal 15?

Binary 10000 = 1 times 2^4 = 16 (decimal) 16 > 15 Binary 10000 (= 16 decimal) is larger than decimal 15.

11. Express decimal 8 in binary and verify.

8 / 2 = 4 remainder 0 4 / 2 = 2 remainder 0 2 / 2 = 1 remainder 0 1 / 2 = 0 remainder 1 Binary: 1000 Verification: 1 times 2^3 + 0 times 2^2 + 0 times 2^1 + 0 times 2^0 = 8 + 0 + 0 + 0 = 8 (Verified)

12. Find the binary equivalent of 0.5 (decimal).

0.5 times 2 = 1.0 → integer part = 1, fractional part = 0 Since fractional part is 0, we stop. 0.5 (decimal) = 0.1 (binary)

Exercise 7.4 — Logic, Flowcharts, and Patterns

1. Identify the next number in the pattern: 2, 4, 6, 8, __

Pattern: Each number increases by 2. Next number = 8 + 2 = 10 Answer: 10

2. Identify the next number in the pattern: 1, 4, 9, 16, 25, __

Pattern: Square numbers. 1 = 1 squared, 4 = 2 squared, 9 = 3 squared, 16 = 4 squared, 25 = 5 squared Next number = 6 squared = 36 Answer: 36

3. Identify the next number in the pattern: 1, 1, 2, 3, 5, 8, __

Pattern: Fibonacci sequence. Each number is the sum of the two previous numbers. 1, 1, 2, 3, 5, 8, ... Next number = 5 + 8 = 13 Answer: 13

4. Identify the next term in the pattern: A, C, E, G, __

Pattern: Every alternate letter of the alphabet. A (1), C (3), E (5), G (7) Next letter: I (9) Answer: I

5. Draw a flowchart to find whether a given number is even or odd.

Flowchart description:

[Start] | [Input: Read number n] | [Diamond: Is n mod 2 = 0?] | +-- Yes --> [Output: "n is even"] | | +-- No -----> [Output: "n is odd"] | [End] Steps: 1. Start (oval) 2. Input n (parallelogram) 3. Decision: n mod 2 = 0? (diamond) 4. If Yes: Output "Even" (parallelogram) -> End (oval) 5. If No: Output "Odd" (parallelogram) -> End (oval)

6. Draw a flowchart to find the sum of the first 10 natural numbers.

Flowchart description:

[Start] | [Set SUM = 0, i = 1] | [Diamond: Is i <= 10?] | +-- Yes --> [SUM = SUM + i] | | | [i = i + 1] | | | (Loop back to diamond) | +-- No -----> [Output: SUM] | [End] Steps: 1. Start (oval) 2. Initialise: SUM = 0, i = 1 (rectangle) 3. Decision: i <= 10? (diamond) 4. If Yes: SUM = SUM + i, i = i + 1, go back to step 3 5. If No: Output SUM (parallelogram) 6. End (oval) Result: SUM = 1 + 2 + 3 + ... + 10 = 55

7. Draw a flowchart to find the largest of three numbers.

Flowchart description:

[Start] | [Input: Read a, b, c] | [Diamond: Is a > b?] | +-- Yes --> [Diamond: Is a > c?] | | | +-- Yes --> [Output: "a is largest"] | | | +-- No ----> [Output: "c is largest"] | +-- No ----> [Diamond: Is b > c?] | +-- Yes --> [Output: "b is largest"] | +-- No ----> [Output: "c is largest"] | [End] Steps: 1. Start (oval) 2. Input a, b, c (parallelogram) 3. Compare a and b (diamond) 4. If a > b: compare a and c (diamond) - If a > c: a is largest - Else: c is largest 5. If b > a: compare b and c (diamond) - If b > c: b is largest - Else: c is largest 6. End (oval)

8. Find the missing number: 3, 6, 12, 24, __

Pattern: Each number is multiplied by 2. 3 times 2 = 6 6 times 2 = 12 12 times 2 = 24 Next number = 24 times 2 = 48 Answer: 48

9. If all roses are flowers and some flowers are red, can we conclude that some roses are red?

Given: - All roses are flowers. (Roses are a subset of flowers) - Some flowers are red. Conclusion: We CANNOT conclude that some roses are red. Explanation: The red flowers could be flowers other than roses. Just because some flowers are red does not mean roses are among those red flowers. In a Venn diagram: - Roses circle is entirely inside the flowers circle. - Red flowers overlap with flowers, but the overlap may or may not include roses. The conclusion is "Not necessarily true."

10. In a row of 40 students, Ravi is 10th from the left and Suma is 15th from the right. How many students are between them?

Ravi's position from left = 10 Suma's position from right = 15 Suma's position from left = 40 - 15 + 1 = 26 Students between Ravi and Suma = (Suma's position from left) - (Ravi's position from left) - 1 = 26 - 10 - 1 = 15 15 students are between Ravi and Suma.

11. Draw a flowchart to check whether a number is positive, negative, or zero.

Flowchart description:

[Start] | [Input: Read n] | [Diamond: Is n > 0?] | +-- Yes --> [Output: "Positive"] --> [End] | +-- No ----> [Diamond: Is n < 0?] | +-- Yes --> [Output: "Negative"] --> [End] | +-- No ----> [Output: "Zero"] --> [End] Steps: 1. Start (oval) 2. Input n (parallelogram) 3. Is n > 0? (diamond) - Yes: Output "Positive" -> End - No: Go to step 4 4. Is n < 0? (diamond) - Yes: Output "Negative" -> End - No: Output "Zero" -> End

12. Complete the pattern: 1, 8, 27, 64, __

Pattern: Cube numbers. 1 = 1 cubed, 8 = 2 cubed, 27 = 3 cubed, 64 = 4 cubed Next number = 5 cubed = 125 Answer: 125

13. In a coding scheme, if APPLE is coded as ELPPA, how is MANGO coded?

Pattern: The word is written in reverse order. APPLE reversed = ELPPA MANGO reversed = OGNAM Answer: OGNAM

14. Draw a flowchart to find the factorial of a number n.

Flowchart description:

[Start] | [Input: Read n] | [Set FACT = 1, i = 1] | [Diamond: Is i <= n?] | +-- Yes --> [FACT = FACT times i] | | | [i = i + 1] | | | (Loop back to diamond) | +-- No -----> [Output: FACT] | [End] Steps: 1. Start (oval) 2. Input n (parallelogram) 3. Initialise: FACT = 1, i = 1 (rectangle) 4. Decision: i <= n? (diamond) 5. If Yes: FACT = FACT * i, i = i + 1, go back to step 4 6. If No: Output FACT (parallelogram) 7. End (oval) Example: n = 5 FACT = 1 * 1 * 2 * 3 * 4 * 5 = 120

15. If FRIEND is coded as HUMGPF, decode the pattern and find the code for WORLD.

Pattern analysis: F -> H (+2) R -> U (+3) I -> M (+4) E -> G (+2) N -> P (+2) D -> F (+2) The pattern shifts letters by varying amounts. Since this appears irregular, let us look for a simpler rule: each letter is shifted by +2 positions. F + 2 = H, R + 3 = U, I + 4 = M, E + 2 = G, N + 2 = P, D + 2 = F If we use +2 for each letter of WORLD: W + 2 = Y O + 2 = Q R + 2 = T L + 2 = N D + 2 = F Answer: YQTNF

Common Mistakes

1. Confusing union and intersection: Union (A union B) includes all elements from both sets. Intersection (A intersection B) includes only the common elements. Always double-check which operation the question asks for.

2. Forgetting to subtract the intersection: When using n(A union B) = n(A) + n(B) - n(A intersection B), students often forget to subtract n(A intersection B). The formula subtracts it because common elements are counted twice in n(A) + n(B).

3. Wrong order in set difference: A - B is NOT the same as B - A. A - B = elements in A but not in B. B - A = elements in B but not in A. Always check the order.

4. Binary conversion direction errors: When converting decimal to binary, read the remainders from bottom to top (last remainder is the leftmost digit). Reading in the wrong order is a very common mistake.

5. Misidentifying universal set: The complement A' is always with respect to the universal set U. If U is not given explicitly, identify it before computing complements.

6. Venn diagram region errors: When shading regions in a Venn diagram, carefully identify which region each label refers to. "Only A" means elements in A but not in B, which is different from "A" (which includes the intersection).

7. Binary addition carry errors: In binary addition, 1 + 1 = 10 (write 0, carry 1). Students sometimes write 2 instead of carrying. Always use base-2 rules.

8. Flowchart missing decision paths: Every diamond (decision) must have exactly two outgoing arrows: one for Yes and one for No. Missing a path means the flowchart is incomplete.

Exam Checklist

  • [ ] Can I write sets in both roster and set-builder form?
  • [ ] Can I compute union, intersection, difference, and complement of two sets?
  • [ ] Can I apply the formula n(A union B) = n(A) + n(B) - n(A intersection B)?
  • [ ] Can I draw and label a two-set Venn diagram with all regions?
  • [ ] Can I draw and label a three-set Venn diagram with all regions?
  • [ ] Can I solve word problems using Venn diagrams (like survey questions)?
  • [ ] Can I state and verify De Morgan's Laws with examples?
  • [ ] Can I convert binary to decimal and decimal to binary correctly?
  • [ ] Can I add and subtract binary numbers?
  • [ ] Can I identify and continue number patterns?
  • [ ] Can I draw flowcharts for simple algorithms (even/odd check, largest of three, factorial)?
  • [ ] Can I solve logic and reasoning puzzles (coding-decoding, position-based)?

Internal Links

  • [Class 8 Maths Solutions](/class/8/maths/solutions/) — All chapter solutions
  • [Class 8 Science Solutions](/class/8/science/solutions/) — Science exercise solutions
  • [Class 8 Social Science Solutions](/class/8/social/solutions/) — Social Science solutions
  • [Class 8 Maths Guide](/class/8/maths/guides/) — Chapter-wise study guides

Frequently Asked Questions

A Venn diagram uses overlapping circles to show relationships between sets. The overlapping region shows elements common to both sets (intersection), and the combined region shows all elements in either set (union). It helps visualise set operations like union, intersection, and complement.
← Browse all Class 8 Mathematics Exercise Solutions

Other question types — same chapter

Chapter Notes

Tamil Nadu Class 8 Maths: Information Processing

Exercise Solutions

Algebra Exercise Solutions | KalviGavani

Exercise Solutions

Geometry Exercise Solutions | KalviGavani