Confirming your payment

Skip to content

Opening your dashboard

Class 9 Maths Chapter 11 The World of Algorithms: Competency-Based Questions (CBQ)

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

40 questions

1–4 marks · Mixed difficulty

  1. 1

    Question 1

    At the railway enquiry office in Bhopal, the clerk must report the total number of passengers for the weekend. She adds Saturday's and Sunday's counts using the algorithm to add two numbers: column by column from right to left, writing one digit below each column and setting the value of carry.

    Passenger board showing Saturday 6,958 passengers and Sunday 2,174 passengers

    Just after the hundreds column has been added, which digit is written below the hundreds column, and what is the value of carry?

    MCQMedium
    1 mark
  2. 2

    Question 2

    A robot sorter in a toy factory must find every way of packing 245 marbles into bags with the same number of marbles in each bag. It runs the algorithm to find the divisors of 245: it starts with an empty list-of-divisors and checks each j=1,2,3,…,245j = 1, 2, 3, \ldots, 245, adding jj to the list whenever jj divides 245.

    Count one update each time a number is added to list-of-divisors. How many updates does the robot make?

    MCQMedium
    1 mark
  3. 3

    Question 3

    For a school quiz, 52 students of Class 9 and 78 students of Class 10 are put into teams. Every team must have the same number of students, each team must come from a single class, and nobody is left out.

    Which team size is not possible?

    MCQMedium
    1 mark
  4. 4

    Question 4

    In the Maths Club game "Euclid's Ladder", a player runs Euclid's subtraction algorithm on gcd⁡(119,51)\gcd(119, 51):

    1. If m<nm < n, reverse the numbers and compute gcd⁡(n,m)\gcd(n, m).

    2. If n=0n = 0, report the answer as mm.

    3. Otherwise, reduce the problem to compute gcd⁡(n,m−n)\gcd(n, m - n).

    The player scores 1 point every time Step 3 is used. Reversing the numbers in Step 1 scores nothing. How many points does the player score?

    MCQMedium
    1 mark
  5. 5

    Question 5

    A school librarian wants to stack 56 Hindi novels and 196 English novels in identical bundles, so she needs gcd⁡(56,196)\gcd(56, 196). Earlier she used the first gcd algorithm, which finds the divisors of 56 by checking every number from 1 to 56 and then the divisors of 196 by checking every number from 1 to 196. Now she uses the improved algorithm: check each jj from 1 to min⁡(56,196)\min(56, 196) and keep jj if it divides both numbers.

    Count one check for each number tested. How many fewer numbers does she check now?

    MCQMedium
    1 mark
  6. 6

    Question 6

    For Diwali, Meera hangs two strings of lights on her balcony. The first string blinks every 12 seconds and the second every 20 seconds. Both blink together at the moment she switches them on. She first finds gcd⁡(12,20)=4\gcd(12, 20) = 4 and then uses it to find when they next blink together.

    After how many seconds do the two strings next blink together?

    MCQMedium
    1 mark
  7. 7

    Question 7

    Simran wants to split 72 volunteers of Class 6 and 104 volunteers of Class 7 into the largest possible identical groups. She starts at k=min⁡(72,104)=72k = \min(72, 104) = 72 and checks k=72,71,70,…k = 72, 71, 70, \ldots downwards, stopping at the first kk that divides both 72 and 104.

    Count every value of kk she checks, including the one at which she stops. How many values of kk does she check?

    MCQMedium
    1 mark
  8. 8

    Question 8

    A Class 3 teacher runs a stamp club. Her students have not yet learnt carrying, so she wants to show them the total stamps in two albums using a pair of counts for which the algorithm to add two numbers never sets carry to 1.

    Which pair of album counts should she choose?

    MCQMedium
    1 mark
  9. 9

    Question 9

    Farhan has 28 apples and 42 oranges to share equally among the largest possible number of children. He runs the first algorithm for gcd: he finds divisors(28)\text{divisors}(28) and divisors(42)\text{divisors}(42), then goes through the divisors of 28 one by one and adds each one that is also a divisor of 42 to the list common-divisors.

    Two statements are given below. One is labelled Assertion (A) and the other is labelled Reason (R). Read the statements carefully and choose the option that correctly describes statements A and R.

    Assertion (A): The list common-divisors that Farhan gets is [1,2,7,14][1, 2, 7, 14], so he can report its rightmost entry, 14, as gcd⁡(28,42)\gcd(28, 42).

    Reason (R): Farhan takes the divisors of 28 in increasing order and keeps only those that also divide 42, so the numbers he keeps are also in increasing order.

    MCQMedium
    1 mark
  10. 10

    Question 10

    Ravi has two ribbons, 77 cm and 28 cm long, and wants to cut both into pieces of the same length, as long as possible, with nothing left over. He uses Euclid's subtraction algorithm on gcd⁡(77,28)\gcd(77, 28).

    Two statements are given below. One is labelled Assertion (A) and the other is labelled Reason (R). Read the statements carefully and choose the option that correctly describes statements A and R.

    Assertion (A): Ravi's run reaches the problem gcd⁡(7,0)\gcd(7, 0) and reports 7.

    Reason (R): Every time Step 3 is used, the larger number of the pair is halved.

    MCQMedium
    1 mark
  11. 11

    Question 11

    Pooja adds the electricity units her family used in two months, 5,687 units and 2,749 units, column by column. Her working is shown below. Her total is 10 units less than the correct total.

    Pooja's column addition: 5687 plus 2749 written as 8426

    (i) In which column did Pooja forget to add the carry? Explain using the column sums.

    (ii) Write the correct total.

    Medium
    2 marks
  12. 12

    Question 12

    A fruit seller in Nagpur has 168 mangoes and 252 oranges. She wants to pack them into identical baskets, each with the same number of mangoes and the same number of oranges, using all the fruit and making as many baskets as possible.

    (i) Using the list of common divisors of 168 and 252, find the number of baskets.

    (ii) How many mangoes and how many oranges go into each basket?

    Medium
    2 marks
  13. 13

    Question 13

    A sports teacher has 45 students of Class 8 and 63 students of Class 9 and wants identical groups. Instead of finding the divisors of 45 and of 63 in two separate scans, she makes one scan, j=1,2,…,max⁡(45,63)j = 1, 2, \ldots, \max(45, 63). For each jj she adds jj to the list of divisors of 45 if it divides 45, and to the list of divisors of 63 if it divides 63.

    (i) Counting each value of jj once, how many values does she check? How many would the two separate scans of the first gcd algorithm check?

    (ii) Write the two lists she gets and the largest group size.

    Medium
    2 marks
  14. 14

    Question 14

    Rohan wants to split 24 red crayon boxes and 36 blue crayon boxes into the largest number of identical gift sets. His "gcd method" for m≤nm \le n is: list the divisors of the smaller number mm, and report the largest divisor that is less than or equal to nn.

    (i) What does Rohan's method report for 24 and 36? Explain why this answer does not fit the definition of gcd.

    (ii) Find the correct gcd and say how many gift sets he can make.

    Medium
    2 marks
  15. 15

    Question 15

    A carpenter in Saharanpur has two wooden rods, 188 cm and 24 cm long. He wants to cut both into pieces of the same length, as long as possible, with no wood wasted.

    Two rods drawn to scale, 188 cm and 24 cm long

    (i) Use Āryabhaṭa's division algorithm (reduce gcd⁡(m,n)\gcd(m, n) to gcd⁡(n,m mod n)\gcd(n, m \bmod n)) on gcd⁡(188,24)\gcd(188, 24), writing each remainder.

    (ii) Count each use of the reduction step as one reduction. How many reductions does it need? Euclid's subtraction algorithm needs 13 reductions here. Explain why subtraction is so slow for these numbers.

    (iii) What is the length of each piece, and how many pieces are there in all?

    Medium
    3 marks
  16. 16

    Question 16

    A school has two halls, one with 90 chairs and one with 114 chairs. The manager wants to arrange the chairs in rows so that every row in both halls has the same number of chairs, with more than one chair in a row and no chair left over.

    (i) Use the first algorithm for gcd to write the list of common divisors of 90 and 114.

    (ii) How many different row lengths can the manager use?

    (iii) What is the longest possible row, and how many rows will each hall have?

    Medium
    3 marks
  17. 17

    Question 17

    A game designer shares 42 red gems and 70 blue gems into identical prize bags, making as many bags as possible. She finds the gcd by keeping only one number, most-recent-common-divisor: it starts at 1, and for each k=2,3,…,42k = 2, 3, \ldots, 42, if kk divides both 42 and 70, it is updated to kk. She starts the trace table below.

    Trace table with columns k, divides 42, divides 70 and most-recent-common-divisor; only the start value 1 is filled in

    (i) For which values of kk is most-recent-common-divisor updated?

    (ii) Counting each value of kk once, how many values does she check?

    (iii) How many bags does she make, and what is in each bag?

    Medium
    3 marks
  18. 18

    Question 18

    At the school book fair in Pune, two stalls collect money all day. In the evening the treasurer, Mr Kulkarni, adds the two takings with the algorithm to add two numbers. He writes the numbers one below the other with the digits aligned from the right, adds the columns from right to left, writes one digit below each column and keeps track of carry. Step 5 of the algorithm writes a 1 at the far left only if carry is 1 after the last column. The takings are shown in the table.

    Table of takings: Stall A ₹38,795 and Stall B ₹46,587

    (i) What is the value of carry after the units column is added?

    (ii) Which digit is written below the hundreds column?

    (iii) Find the total takings. In how many columns is carry set to 1, and is Step 5 needed?

    Medium
    4 marks
  19. 19

    Question 19

    A school playground in Jaipur is a rectangle 420 m long and 300 m wide. The gardener wants to plant trees along its boundary, all the same distance apart, with a tree at each of the four corners, so the spacing must fit a whole number of times along every side. Saplings are costly, so she wants the trees as far apart as possible. The nursery first suggests a spacing of 20 m.

    Plan of the playground: a rectangle 420 m long and 300 m wide with a tree at each corner

    (i) Can a spacing of 20 m be used? Give a reason and find the number of trees it needs.

    (ii) Find the largest spacing that can be used.

    (iii) How many trees are planted with the largest spacing? Explain why the gcd gives the largest spacing.

    Medium
    4 marks
  20. 20

    Question 20

    A coding club holds an "algorithm race". Each team must find gcd⁡(96,132)\gcd(96, 132) to pack 96 apples and 132 bananas into identical fruit baskets, and the team that checks the fewest numbers wins. Team 1 uses the first gcd algorithm and counts the divisibility checks made while listing the divisors of 96 and of 132. Team 2 checks each jj from 1 to min⁡(96,132)\min(96, 132). Team 3 checks k=96,95,94,…k = 96, 95, 94, \ldots downwards and stops at the first kk dividing both, counting that kk too.

    Table of the three teams and their methods with an empty checks column

    (i) How many divisibility checks does Team 1 make?

    (ii) How many numbers does Team 2 check?

    (iii) At which kk does Team 3 stop, how many numbers does it check, and which team wins?

    Medium
    4 marks
  21. 21

    Question 21

    In the game "Carry Chain", the screen shows the score 4,587. A player must type a 4-digit number to add to it so that, when the two numbers are added with the algorithm to add two numbers, carry is set to 1 in every one of the four columns (a column that adds up to 10 or more sets carry to 1). The player who types the smallest such number wins.

    Which number wins?

    MCQHard
    1 mark
  22. 22

    Question 22

    A shopkeeper adds his seven daily bills, each a 4-digit amount in rupees, all at once. He extends the algorithm to add two numbers: in each column he adds all seven digits and the current carry, writes the units digit of this sum below the column, and sets carry to the number of tens in the sum.

    What is the largest value carry can ever take?

    MCQHard
    1 mark
  23. 23

    Question 23

    A school can fix the strength of a new section at 78, 81, 80 or 76 students. The principal wants the strength that gives the most ways of seating the class in equal rows (every row the same size, nobody left out, counting 1 row of all students and rows of 1 student as ways too). Each way matches one entry in the list-of-divisors produced by the divisors algorithm.

    Which strength should she choose?

    MCQHard
    1 mark
  24. 24

    Question 24

    Four friends each pick a card and run Euclid's subtraction algorithm on the pair written on it. A reduction is one use of Step 3, gcd⁡(m,n)→gcd⁡(n,m−n)\gcd(m, n) \to \gcd(n, m - n); reversing the numbers in Step 1 is not counted.

    Whose card needs the most reductions?

    MCQHard
    1 mark
  25. 25

    Question 25

    To make identical sweet boxes faster, Ishaan "speeds up" the gcd scan. He checks k=2,3,4,…k = 2, 3, 4, \ldots and stops at the first kk that divides both numbers, reporting that kk as the gcd (he reports 1 if no kk up to the smaller number works). Each option gives the numbers of two kinds of sweets.

    For which pair does Ishaan's method still report the correct gcd?

    MCQHard
    1 mark
  26. 26

    Question 26

    Two lighthouses on the Konkan coast flash every 48 seconds and every 80 seconds. They flash together at exactly 6:00 pm.

    How many times do they flash together from 6:00 pm to 7:00 pm, counting both 6:00 pm and 7:00 pm if they flash together at those moments?

    MCQHard
    1 mark
  27. 27

    Question 27

    A school computer ran the algorithm for common divisors on 90, the number of Class 9 students, and nn, the number of Class 10 students. It printed the list common-divisors =[1,2,3,5,6,10,15,30]= [1, 2, 3, 5, 6, 10, 15, 30], but the value of nn got smudged. The office knows that nn is more than 100 and less than 150.

    Which of these can nn be?

    MCQHard
    1 mark
  28. 28

    Question 28

    A dance teacher wants a group size that can stand in equal rows in exactly three ways (every row the same size, nobody left out, counting one single row and rows of one dancer as ways too). So the divisors algorithm run on the group size must give a list-of-divisors with exactly three entries.

    Which group size should she choose?

    MCQHard
    1 mark
  29. 29

    Question 29

    Leela is making identical bead strings from mm red beads and nn blue beads. Halfway through the first gcd algorithm, she notices that 7 is already in her list common-divisors.

    Two statements are given below. One is labelled Assertion (A) and the other is labelled Reason (R). Read the statements carefully and choose the option that correctly describes statements A and R.

    Assertion (A): gcd⁡(m,n)\gcd(m, n) must be a multiple of 7.

    Reason (R): gcd⁡(m,n)\gcd(m, n) is the rightmost, and therefore the largest, entry of the list common-divisors.

    MCQHard
    1 mark
  30. 30

    Question 30

    Two teams in a Maths Club race to finish Euclid's subtraction algorithm by hand. Team Red gets gcd⁡(150,4)\gcd(150, 4) and Team Blue gets gcd⁡(150,140)\gcd(150, 140). A reduction is one use of Step 3, gcd⁡(m,n)→gcd⁡(n,m−n)\gcd(m, n) \to \gcd(n, m - n).

    Two statements are given below. One is labelled Assertion (A) and the other is labelled Reason (R). Read the statements carefully and choose the option that correctly describes statements A and R.

    Assertion (A): Team Red needs fewer reductions than Team Blue.

    Reason (R): The number of reductions depends on the sizes of the numbers, not only on how many digits they have.

    MCQHard
    1 mark
  31. 31

    Question 31

    The turnstile counter at a stadium in Kolkata shows 6 digits. So far today it reads 6,48,275 entries. The computer adds each new batch of entries to this count with the algorithm to add two numbers, setting carry to 1 whenever a column adds up to 10 or more.

    (i) What is the smallest number of further entries that, added to 6,48,275, makes the algorithm use Step 5 (write 1 at the far left, giving a 7th digit)? Justify that it is the smallest.

    (ii) In that addition, in how many columns is carry set to 1? Show the column sums.

    Hard
    2 marks
  32. 32

    Question 32

    Riya is planting 72 neem saplings and 120 mango saplings in rows of equal length, with only one kind of tree in each row. She claims: "The list of common divisors of 72 and 120 is exactly the list of divisors of their gcd."

    (i) Execute the first algorithm for gcd on 72 and 120 and write the list common-divisors and the gcd.

    (ii) Check Riya's claim for these numbers, and explain why it must hold, using the idea of tiling with blocks.

    Hard
    2 marks
  33. 33

    Question 33

    A school has 391 boys and 299 girls to form identical sports teams (the most teams possible, each with the same numbers of boys and of girls). Three apps find gcd⁡(391,299)\gcd(391, 299). App 1 uses most-recent-common-divisor, checking k=2,3,…,299k = 2, 3, \ldots, 299. App 2 uses Euclid's subtraction algorithm. App 3 uses Āryabhaṭa's division algorithm. Count one check for each kk, and one reduction for each use of Step 3.

    (i) How many values of kk does App 1 check? How many reductions does App 2 make?

    (ii) Trace App 3, say which app does the least work, and describe the teams.

    Hard
    2 marks
  34. 34

    Question 34

    Tanvi has 161 marigolds and 69 roses and wants to make as many identical garlands as possible, using every flower. She runs Euclid's subtraction algorithm on gcd⁡(161,69)\gcd(161, 69) in her notebook and gets the answer 3. Her working is shown below.

    Tanvi's notebook trace of Euclid's subtraction algorithm for gcd(161, 69), ending with the answer 3

    (i) Find the first wrong line in her working and say what went wrong.

    (ii) Write the correct continuation and the correct gcd. How can you tell, without redoing the work, that 3 cannot be the gcd?

    Hard
    2 marks
  35. 35

    Question 35

    Three stalls at a village mela in Pushkar took the amounts on the receipts below. The treasurer wants to add all three amounts at once, column by column, instead of adding two and then the third.

    Three receipt slips for ₹2,968, ₹4,795 and ₹3,887

    (i) How must the steps of the algorithm to add two numbers change to add three numbers at once?

    (ii) Execute your changed algorithm on the three amounts, writing the digit and carry for each column.

    (iii) Check your total another way: add ₹2,968 and ₹4,795 with the algorithm to add two numbers, then add ₹3,887 to that result. How many columns does the treasurer add this way, compared with adding all three at once?

    Hard
    3 marks
  36. 36

    Question 36

    In a clock workshop, two gear wheels mesh with each other. One has 84 teeth and the other has 90 teeth. One tooth on each wheel is marked, and the two marked teeth touch at the start. Each time one tooth passes the meeting point, the other wheel also moves on by one tooth.

    Two meshing gear wheels labelled 84 teeth and 90 teeth with one marked tooth each touching

    (i) The marks meet again when the number of teeth passed is a multiple of both 84 and 90. Scanning the multiples of 90 in order (90, 180, 270, …), and counting the multiple at which you stop, how many multiples do you check before reaching the first one that 84 divides?

    (ii) Get the same number using gcd⁡(84,90)\gcd(84, 90).

    (iii) How many full turns does each wheel make before the marks meet again?

    Hard
    3 marks
  37. 37

    Question 37

    A coding club must share 217 badges and 155 stickers equally among the largest possible number of members, so it needs gcd⁡(217,155)\gcd(217, 155). The members compare how much work five methods take. Count one check for each number tested, and one reduction for each use of Step 3 of Euclid's algorithm.

    Table of five gcd methods with an empty column for the amount of work

    (i) Find the number of checks for methods 1, 2 and 3.

    (ii) Method 4 checks k=155,154,…k = 155, 154, \ldots downwards and stops at the first kk dividing both numbers, counting that kk. At which kk does it stop, and how many checks does it make?

    (iii) Find the number of reductions for method 5. Rank the five methods from least to most work.

    Hard
    3 marks
  38. 38

    Question 38

    For Diwali, Kavya wants to pack 500 diyas and 36 candles into identical gift packs, making as many packs as possible with nothing left over. Her grandfather tells her that Āryabhaṭa's Āryabhaṭīya (499 CE) found such answers by repeated division instead of repeated subtraction. Kavya runs Euclid's subtraction algorithm, which reduces gcd⁡(m,n)\gcd(m, n) to gcd⁡(n,m−n)\gcd(n, m - n). Her brother runs Āryabhaṭa's division algorithm, which reduces gcd⁡(m,n)\gcd(m, n) to gcd⁡(n,m mod n)\gcd(n, m \bmod n). Both reverse the numbers when m<nm < n, and each use of the reduction step counts as one reduction.

    Table of the items to pack: 500 diyas and 36 candles

    (i) What problem does Kavya get after her first reduction?

    (ii) Write her brother's full trace, with each remainder.

    (iii) How many reductions does each of them make? How many packs are made, and what is in each pack?

    Hard
    4 marks
  39. 39

    Question 39

    A school library in Lucknow has received 288 Hindi books and 432 English books. The librarian wants to put them into identical boxes, each with the same number of Hindi books and the same number of English books, using as many boxes as possible and boxing every book. She uses the first algorithm for gcd: find the divisors of each number by checking every number from 1 up to it, then keep the divisors of 288 that also divide 432.

    Shelf card showing 288 Hindi books and 432 English books

    (i) How many entries does divisors(288)\text{divisors}(288) have?

    (ii) How many entries does the list common-divisors have?

    (iii) How many boxes does she use, and what is in each box? How many divisibility checks does the algorithm make while finding the two lists of divisors?

    Hard
    4 marks
  40. 40

    Question 40

    The Art Club and the Music Club each keep their members' roll numbers as a list in increasing order. For the annual day the secretary needs one list, in increasing order, of everyone in at least one club, with no roll number repeated. She compares the first unused entries of the two lists: she writes down the smaller one and moves past it; if they are equal, she writes it once and moves past it in both lists. Each such test is one comparison. When one list runs out, she copies the rest of the other list without comparing.

    Two sorted lists of roll numbers: Art Club 103, 117, 128, 145, 162, 170 and Music Club 109, 117, 131, 145, 158

    (i) Write the first four entries of her combined list.

    (ii) Which students are in both clubs?

    (iii) How many comparisons does she make in all? Why is one pass through the two lists enough?

    Hard
    4 marks