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
- 11 mark
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.
Just after the hundreds column has been added, which digit is written below the hundreds column, and what is the value of
carry? - 21 mark
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-divisorsand checks each , adding to the list whenever divides 245.Count one update each time a number is added to
list-of-divisors. How many updates does the robot make? - 31 mark
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?
- 41 mark
Question 4
In the Maths Club game "Euclid's Ladder", a player runs Euclid's subtraction algorithm on :
-
If , reverse the numbers and compute .
-
If , report the answer as .
-
Otherwise, reduce the problem to compute .
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?
-
- 51 mark
Question 5
A school librarian wants to stack 56 Hindi novels and 196 English novels in identical bundles, so she needs . 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 from 1 to and keep if it divides both numbers.
Count one check for each number tested. How many fewer numbers does she check now?
- 61 mark
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 and then uses it to find when they next blink together.
After how many seconds do the two strings next blink together?
- 71 mark
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 and checks downwards, stopping at the first that divides both 72 and 104.
Count every value of she checks, including the one at which she stops. How many values of does she check?
- 81 mark
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
carryto 1.Which pair of album counts should she choose?
- 91 mark
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 and , 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-divisorsthat Farhan gets is , so he can report its rightmost entry, 14, as .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.
- 101 mark
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 .
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 and reports 7.
Reason (R): Every time Step 3 is used, the larger number of the pair is halved.
- 112 marks
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.

(i) In which column did Pooja forget to add the
carry? Explain using the column sums.(ii) Write the correct total.
- 122 marks
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?
- 132 marks
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, . For each she adds 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 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.
- 142 marks
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 is: list the divisors of the smaller number , and report the largest divisor that is less than or equal to .
(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.
- 153 marks
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.

(i) Use Āryabhaṭa's division algorithm (reduce to ) on , 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?
- 163 marks
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?
- 173 marks
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 , if divides both 42 and 70, it is updated to . She starts the trace table below.
(i) For which values of is
most-recent-common-divisorupdated?(ii) Counting each value of once, how many values does she check?
(iii) How many bags does she make, and what is in each bag?
- 184 marks
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 ifcarryis 1 after the last column. The takings are shown in the table.
(i) What is the value of
carryafter the units column is added?(ii) Which digit is written below the hundreds column?
(iii) Find the total takings. In how many columns is
carryset to 1, and is Step 5 needed? - 194 marks
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.

(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.
- 204 marks
Question 20
A coding club holds an "algorithm race". Each team must find 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 from 1 to . Team 3 checks downwards and stops at the first dividing both, counting that too.

(i) How many divisibility checks does Team 1 make?
(ii) How many numbers does Team 2 check?
(iii) At which does Team 3 stop, how many numbers does it check, and which team wins?
- 211 mark
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,
carryis set to 1 in every one of the four columns (a column that adds up to 10 or more setscarryto 1). The player who types the smallest such number wins.Which number wins?
- 221 mark
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 setscarryto the number of tens in the sum.What is the largest value
carrycan ever take? - 231 mark
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-divisorsproduced by the divisors algorithm.Which strength should she choose?
- 241 mark
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, ; reversing the numbers in Step 1 is not counted.
Whose card needs the most reductions?
- 251 mark
Question 25
To make identical sweet boxes faster, Ishaan "speeds up" the gcd scan. He checks and stops at the first that divides both numbers, reporting that as the gcd (he reports 1 if no 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?
- 261 mark
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?
- 271 mark
Question 27
A school computer ran the algorithm for common divisors on 90, the number of Class 9 students, and , the number of Class 10 students. It printed the list
common-divisors, but the value of got smudged. The office knows that is more than 100 and less than 150.Which of these can be?
- 281 mark
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-divisorswith exactly three entries.Which group size should she choose?
- 291 mark
Question 29
Leela is making identical bead strings from red beads and 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): must be a multiple of 7.
Reason (R): is the rightmost, and therefore the largest, entry of the list
common-divisors. - 301 mark
Question 30
Two teams in a Maths Club race to finish Euclid's subtraction algorithm by hand. Team Red gets and Team Blue gets . A reduction is one use of Step 3, .
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.
- 312 marks
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
carryto 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
carryset to 1? Show the column sums. - 322 marks
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-divisorsand the gcd.(ii) Check Riya's claim for these numbers, and explain why it must hold, using the idea of tiling with blocks.
- 332 marks
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 . App 1 uses
most-recent-common-divisor, checking . App 2 uses Euclid's subtraction algorithm. App 3 uses Āryabhaṭa's division algorithm. Count one check for each , and one reduction for each use of Step 3.(i) How many values of 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.
- 342 marks
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 in her notebook and gets the answer 3. Her working is shown below.

(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?
- 353 marks
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.

(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
carryfor 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?
- 363 marks
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.

(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 .
(iii) How many full turns does each wheel make before the marks meet again?
- 373 marks
Question 37
A coding club must share 217 badges and 155 stickers equally among the largest possible number of members, so it needs . 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.

(i) Find the number of checks for methods 1, 2 and 3.
(ii) Method 4 checks downwards and stops at the first dividing both numbers, counting that . At which 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.
- 384 marks
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 to . Her brother runs Āryabhaṭa's division algorithm, which reduces to . Both reverse the numbers when , and each use of the reduction step counts as one reduction.

(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?
- 394 marks
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.

(i) How many entries does have?
(ii) How many entries does the list
common-divisorshave?(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?
- 404 marks
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.

(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?
