Confirming your payment

Skip to content

Opening your dashboard

Class 9 Maths Chapter 11 The World of Algorithms: Practice Questions

20 questions on Chapter 11, each worked through on its own page with the AI tutor. Class 9 Maths, CBSE 2026-27.

20 questions

1–4 marks · Medium difficulty

  1. 1

    Question 1

    Farida helps at her school canteen. The sales board shows ₹ 47,586 for Monday and ₹ 36,749 for Tuesday. Her brother Imran finds the two-day total with the addition algorithm: he writes the amounts one below the other and adds column by column from right to left, setting carry after each column.

    Canteen sales board showing Monday ₹ 47,586 and Tuesday ₹ 36,749

    Counting each column once, in how many columns does Imran set carry to 1?

    MCQMedium
    1 mark
  2. 2

    Question 2

    Anjali has made 72 laddoos and wants to pack them in boxes, every box holding the same number. To see all her choices she executes the algorithm to find the divisors of 72, checking j=1,2,3,…j = 1, 2, 3, \ldots in order and adding each jj that divides 72 to list-of-divisors.

    What is list-of-divisors just after she has checked j=10j = 10?

    MCQMedium
    1 mark
  3. 3

    Question 3

    A sports club has 40 girls and 64 boys. The coach wants teams of the largest possible equal size, each team only girls or only boys, with nobody left out. The club's app uses the first algorithm for gcd: Step 1 finds divisors(40)\text{divisors}(40) by checking every jj from 1 to 40, and Step 2 finds divisors(64)\text{divisors}(64) by checking every jj from 1 to 64.

    Counting one divisibility check for each jj tested, how many divisibility checks does the app make in Steps 1 and 2 together?

    MCQMedium
    1 mark
  4. 4

    Question 4

    A tailor in Surat has two rolls of the same cloth, 132 m and 48 m long. She wants to cut both into pieces of the largest possible equal length with no cloth wasted, so she finds gcd⁡(132,48)\gcd(132, 48) with Euclid's subtraction algorithm, writing down every problem gcd⁡(…,…)\gcd(\ldots, \ldots) she reaches, before and after each reversal.

    Which of these problems never appears in her working?

    MCQMedium
    1 mark
  5. 5

    Question 5

    A sweet-shop owner has 84 laddoos and 108 jalebis. She wants trays that each hold the same number of sweets, laddoo trays and jalebi trays of the same size, with nothing left over. Instead of two separate scans, she uses the improved method that builds both lists of divisors together: one scan of j=1,2,…,max⁡(84,108)j = 1, 2, \ldots, \max(84, 108), adding jj to the first list if it divides 84 and to the second list if it divides 108.

    Counting one check for each value of jj in the scan, how many values of jj does this single scan check?

    MCQMedium
    1 mark
  6. 6

    Question 6

    At a school assembly there are 198 boys and 270 girls. The PT teacher wants them in rows: boys' rows have only boys, girls' rows have only girls, every row (boys' or girls') has the same number of students, and nobody is left out.

    Counting each possible row size once (a row of 1 student included), how many different row sizes can she choose?

    MCQMedium
    1 mark
  7. 7

    Question 7

    A 400 m race at a district meet was run in two heats. Each heat's finishing times (in seconds) are already kept as a list in increasing order:

    • Heat 1: [52,58,63,71,80][52, 58, 63, 71, 80]
    • Heat 2: [55,60,67,74][55, 60, 67, 74]

    For the final ranking, the organiser merges the two sorted lists into one sorted list by repeatedly comparing the first remaining time of each list and taking the smaller.

    Counting the fastest runner as 1st, which time is in 6th place?

    MCQMedium
    1 mark
  8. 8

    Question 8

    A museum adds two days' ticket counts with the addition algorithm. Step 5 of the algorithm says: if the value of carry is 1 after the last column, write 1 to the left of the bottom row.

    For which of these pairs of daily counts will Step 5 actually write a 1?

    MCQMedium
    1 mark
  9. 9

    Question 9

    The courtyard of a community hall in Udaipur is a rectangle 360 cm long and 264 cm wide. It is to be paved with identical square tiles, using only whole tiles, with no gaps and no tile cut. The contractor wants the largest tiles possible.

    Rectangular courtyard 360 cm long and 264 cm wide

    (i) Using the common divisors of 360 and 264, find the side of the largest square tile.

    (ii) How many such tiles are needed?

    Medium
    2 marks
  10. 10

    Question 10

    A music school has 48 sitar students and 72 tabla students. Meghna wants practice groups that are all the same size, each group only sitar or only tabla, with nobody left out, and she wants the largest such size. She tries two methods.

    • Method 1: for each jj from 1 to 48, if jj divides both 48 and 72, add jj to a list of common divisors.
    • Method 2: set most-recent-common-divisor to 1; for each kk from 2 to 48, if kk divides both 48 and 72, update most-recent-common-divisor to kk.

    (i) Counting each number in the list once, how many numbers does Method 1 have stored at the end? Write the list.

    (ii) At which values of kk is most-recent-common-divisor updated in Method 2, and what value does it hold at the end?

    Medium
    2 marks
  11. 11

    Question 11

    Tea spilled on a canteen register has hidden three digits of an addition. The register shows (? marks a hidden digit):

    ?67?+2?58=7433?67? + 2?58 = 7433

    The total, ₹ 7,433, is fully visible.

    Canteen register with the sum ?67? + 2?58 = 7433, three digits hidden by tea stains

    (i) Working column by column from the right, as the addition algorithm does, find the three hidden digits.

    (ii) Write the value of carry set by each column (units, tens, hundreds, thousands).

    Medium
    2 marks
  12. 12

    Question 12

    At a bus depot in Pune, Route A buses leave every 18 minutes and Route B buses leave every 30 minutes. One bus of each route leaves together at 7:00 am.

    (i) Find gcd⁡(18,30)\gcd(18, 30) from the common divisors of 18 and 30.

    (ii) Using lcm(m,n)=m×ngcd⁡(m,n)\text{lcm}(m, n) = \dfrac{m \times n}{\gcd(m, n)}, find the next time both routes leave together.

    Medium
    2 marks
  13. 13

    Question 13

    For a school concert, the booked seat numbers in Row C are kept as a list in increasing order:

    [3,8,15,21,30,42,57,66][3, 8, 15, 21, 30, 42, 57, 66]

    Row C booking list: eight boxes showing 3, 8, 15, 21, 30, 42, 57, 66 in order

    To answer a parent's question, the usher reads the list from the left, one entry at a time, and stops as soon as she finds the seat or reaches an entry larger than it. Count one comparison for each entry she reads.

    (i) A parent asks for seat 35. Is it booked, and after how many comparisons does the usher know?

    (ii) How many comparisons does she need for seat 57? If the list were kept in no particular order, how many comparisons would she need to be sure that seat 35 is not booked? Why?

    Medium
    2 marks
  14. 14

    Question 14

    Ritu is setting out 156 chairs for a prize-giving in equal rows, with no chair left over. To see every possible row length, she executes the algorithm to find the divisors of 156, but in a hurry she writes

    [1,2,3,4,6,12,13,39,52,78,156][1, 2, 3, 4, 6, 12, 13, 39, 52, 78, 156]

    (i) Which divisor has she missed, and for which value of jj should it have been added?

    (ii) Counting each possible number of chairs in a row as one arrangement, how many arrangements are there?

    Medium
    2 marks
  15. 15

    Question 15

    A farmhouse has two water tanks holding 234 litres and 90 litres. The owner wants the largest bucket that can empty each tank exactly, in whole bucketfuls.

    (i) Find gcd⁡(234,90)\gcd(234, 90) using Āryabhaṭa's division algorithm, writing the remainder at each step.

    (ii) What size of bucket should she buy, and how many bucketfuls empty each tank?

    (iii) Counting one reduction for each use of Step 3, how many reductions does Euclid's subtraction algorithm need for gcd⁡(234,90)\gcd(234, 90)? Which algorithm is quicker here?

    Medium
    3 marks
  16. 16

    Question 16

    A school club has 66 pencils and 110 erasers. It wants to make identical stationery kits using every pencil and every eraser, and as many kits as possible.

    (i) Use the algorithm to find the divisors of a number to write divisors(66)\text{divisors}(66) and divisors(110)\text{divisors}(110).

    (ii) Following the first algorithm for gcd, write the list common-divisors and hence gcd⁡(66,110)\gcd(66, 110).

    (iii) How many kits can be made, and what does each kit contain?

    Medium
    3 marks
  17. 17

    Question 17

    Kabir has 80 chocolate bars and 140 toffees to share into identical gift bags. He already has the two lists of divisors, each in increasing order:

    Two sorted lists: divisors of 80 (1, 2, 4, 5, 8, 10, 16, 20, 40, 80) and divisors of 140 (1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 140)

    He finds the common divisors by scanning both lists together: compare the current entry of each list; if they are equal, record the number and move on in both lists; otherwise move on in the list with the smaller entry. He stops when either list runs out. Count one comparison each time he compares two entries.

    (i) Write the list of common divisors of 80 and 140.

    (ii) How many comparisons does Kabir's scan make?

    (iii) His friend instead takes each of the 10 entries of the first list and compares it with all 12 entries of the second list. How many comparisons is that? Why does Kabir's method need so many fewer?

    Medium
    3 marks
  18. 18

    Question 18

    At a school fair, Neha and Arjun compare two ways of adding numbers. Neha draws one dot for each unit of both numbers and counts all the dots, one dot per second. Arjun uses the column addition algorithm and takes 10 seconds per column. Assume drawing the dots takes no time; only counting is timed.

    (i) Find the time each of them takes for 486+357486 + 357.

    (ii) Find the time each of them takes for 4,86,215 + 3,57,694. Give Neha's time in hours, to the nearest hour.

    (iii) Neha says: "The second sum has twice as many digits as the first, so each of us will take about twice as long." Use your answers to (i) and (ii) to test her claim for each method, and explain the difference.

    Medium
    3 marks
  19. 19

    Question 19

    For the sports-day march-past at a school in Lucknow, the three houses have 112 (Red), 140 (Blue) and 154 (Green) students. The sports teacher wants marching teams that all have the same number of students. Each team comes from a single house, every student is in a team, and the teams should be as large as possible. She starts by finding the divisors of each house strength with the algorithm that checks every jj from 1 up to the number.

    Table of house strengths: Red 112, Blue 140, Green 154

    (i) Counting each divisor once, how many entries does divisors(112)\text{divisors}(112) have?

    (ii) Write the list of common divisors of 112 and 140.

    (iii) Find the largest team size that works for all three houses, and the total number of teams.

    Medium
    4 marks
  20. 20

    Question 20

    Ira has a rectangular craft sheet 136 cm long and 56 cm wide. She cuts it into squares this way: each time she cuts off the largest square she can from one end of the rectangle that is left, and carries on with the leftover strip, until nothing is left. Her teacher points out that each cut is one reduction of Euclid's subtraction algorithm, gcd⁡(m,n)→gcd⁡(n,m−n)\gcd(m, n) \to \gcd(n, m - n): cutting a square of side nn from an m×nm \times n rectangle leaves an (m−n)×n(m - n) \times n rectangle.

    Craft sheet 136 cm by 56 cm

    (i) What are the length and width of the rectangle left after the first cut?

    (ii) What is the side of the last square she cuts?

    (iii) How many squares does she cut in all, and how many of each size? How does this compare with the number of reductions (uses of Step 3) in Euclid's subtraction algorithm for gcd⁡(136,56)\gcd(136, 56)?

    Medium
    4 marks