The World of Algorithms - New Edition · Class 9 Mathematics
Practise 100 short and long answer questions on The World of Algorithms from The World of Algorithms - New Edition. Try writing your own answer first, then tap the question to compare it with the model answer and read the explanation behind it.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 473 + 695 = 1168.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 510 + 724 = 1234.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 547 + 753 = 1300.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 584 + 782 = 1366.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 621 + 811 = 1432.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 658 + 840 = 1498.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 695 + 869 = 1564.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 732 + 898 = 1630.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 769 + 927 = 1696.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 806 + 956 = 1762.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 843 + 985 = 1828.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 880 + 1014 = 1894.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 917 + 1043 = 1960.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 954 + 1072 = 2026.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 991 + 1101 = 2092.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 1028 + 1130 = 2158.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 1065 + 1159 = 2224.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 1102 + 1188 = 2290.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 1139 + 1217 = 2356.
The carry transfers the extra tens from one column to the next, preserving place value.
Align the numbers by place value and add from right to left, carrying when a column total reaches 10 or more. The sum is 1176 + 1246 = 2422.
The carry transfers the extra tens from one column to the next, preserving place value.
Using the division method: 84 = 36 × 2 + 12. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 12.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 90 = 40 × 2 + 10. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 10.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 96 = 44 × 2 + 8. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 4.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 102 = 48 × 2 + 6. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 6.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 108 = 52 × 2 + 4. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 4.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 114 = 56 × 2 + 2. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 2.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 120 = 60 × 2 + 0. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 60.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 126 = 64 × 1 + 62. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 2.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 132 = 68 × 1 + 64. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 4.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 138 = 72 × 1 + 66. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 6.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 144 = 76 × 1 + 68. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 4.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 150 = 80 × 1 + 70. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 10.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 156 = 84 × 1 + 72. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 12.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 162 = 88 × 1 + 74. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 2.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 168 = 92 × 1 + 76. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 4.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 174 = 96 × 1 + 78. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 6.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 180 = 100 × 1 + 80. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 20.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 186 = 104 × 1 + 82. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 2.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 192 = 108 × 1 + 84. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 12.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 198 = 112 × 1 + 86. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 2.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 204 = 116 × 1 + 88. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 4.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 210 = 120 × 1 + 90. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 30.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 216 = 124 × 1 + 92. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 4.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 222 = 128 × 1 + 94. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 2.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 228 = 132 × 1 + 96. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 12.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 234 = 136 × 1 + 98. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 2.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 240 = 140 × 1 + 100. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 20.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 246 = 144 × 1 + 102. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 6.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 252 = 148 × 1 + 104. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 4.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
Using the division method: 258 = 152 × 1 + 106. Continue the Euclidean process until the remainder is 0. The last non-zero remainder is the GCD, 2.
The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.
The positive divisors of 20 are 1, 2, 4, 5, 10, 20. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 21 are 1, 3, 7, 21. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 22 are 1, 2, 11, 22. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 23 are 1, 23. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 24 are 1, 2, 3, 4, 6, 8, 12, 24. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 25 are 1, 5, 25. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 26 are 1, 2, 13, 26. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 27 are 1, 3, 9, 27. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 28 are 1, 2, 4, 7, 14, 28. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 29 are 1, 29. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 30 are 1, 2, 3, 5, 6, 10, 15, 30. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 31 are 1, 31. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 32 are 1, 2, 4, 8, 16, 32. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 33 are 1, 3, 11, 33. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 34 are 1, 2, 17, 34. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 35 are 1, 5, 7, 35. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 36 are 1, 2, 3, 4, 6, 9, 12, 18, 36. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 37 are 1, 37. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 38 are 1, 2, 19, 38. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
The positive divisors of 39 are 1, 3, 13, 39. To find a GCD, compare the divisor lists of both numbers and select the greatest common divisor.
A common divisor divides both numbers without a remainder.
An algorithm is a precisely described, step-by-step procedure for arriving at an answer or completing a task.
The answer connects the definition or procedure to its purpose in systematic problem solving.
Precise steps reduce ambiguity and allow the procedure to be followed consistently by different people or by a computer.
The answer connects the definition or procedure to its purpose in systematic problem solving.
A carry records the tens or higher place-value part of a column sum and adds it to the next column on the left.
The answer connects the definition or procedure to its purpose in systematic problem solving.
A counterexample is a specific case that satisfies the stated conditions but contradicts the claimed conclusion.
The answer connects the definition or procedure to its purpose in systematic problem solving.
The number of possible candidates grows with the number, so testing every integer can require many unnecessary steps.
The answer connects the definition or procedure to its purpose in systematic problem solving.
Divide the larger number by the smaller one and replace the pair by the smaller number and the remainder. Repeat until the remainder is zero.
The answer connects the definition or procedure to its purpose in systematic problem solving.
At each non-final step the remainder is a non-negative integer smaller than the divisor. The remainders therefore decrease until zero is reached.
The answer connects the definition or procedure to its purpose in systematic problem solving.
It is the greatest common divisor of the original pair because each division step preserves their common divisors.
The answer connects the definition or procedure to its purpose in systematic problem solving.
Repeatedly subtract the smaller positive number from the larger. The common divisors remain unchanged, and equal final values give the GCD.
The answer connects the definition or procedure to its purpose in systematic problem solving.
A single division step can remove many repeated subtractions at once by producing a quotient and a smaller remainder.
The answer connects the definition or procedure to its purpose in systematic problem solving.
It is an organised way of storing and arranging information so that an algorithm can access and process it.
The answer connects the definition or procedure to its purpose in systematic problem solving.
Analysis helps estimate the work required as the input grows and allows different procedures to be compared.
The answer connects the definition or procedure to its purpose in systematic problem solving.
The input identifies the information to be processed, while the output states the result the procedure must produce.
The answer connects the definition or procedure to its purpose in systematic problem solving.
Test it on suitable examples, inspect whether each step follows logically, and verify that the output satisfies the required condition.
The answer connects the definition or procedure to its purpose in systematic problem solving.
A procedure intended to solve a problem must eventually stop and produce its result rather than continue indefinitely.
The answer connects the definition or procedure to its purpose in systematic problem solving.
The required length is the GCD of 96 and 72, which is 24 cm. The first ribbon gives 4 pieces and the second gives 3 pieces, for a total of 7.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 108 and 78, which is 6 cm. The first ribbon gives 18 pieces and the second gives 13 pieces, for a total of 31.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 120 and 84, which is 12 cm. The first ribbon gives 10 pieces and the second gives 7 pieces, for a total of 17.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 132 and 90, which is 6 cm. The first ribbon gives 22 pieces and the second gives 15 pieces, for a total of 37.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 144 and 96, which is 48 cm. The first ribbon gives 3 pieces and the second gives 2 pieces, for a total of 5.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 156 and 102, which is 6 cm. The first ribbon gives 26 pieces and the second gives 17 pieces, for a total of 43.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 168 and 108, which is 12 cm. The first ribbon gives 14 pieces and the second gives 9 pieces, for a total of 23.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 180 and 114, which is 6 cm. The first ribbon gives 30 pieces and the second gives 19 pieces, for a total of 49.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 192 and 120, which is 24 cm. The first ribbon gives 8 pieces and the second gives 5 pieces, for a total of 13.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 204 and 126, which is 6 cm. The first ribbon gives 34 pieces and the second gives 21 pieces, for a total of 55.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 216 and 132, which is 12 cm. The first ribbon gives 18 pieces and the second gives 11 pieces, for a total of 29.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 228 and 138, which is 6 cm. The first ribbon gives 38 pieces and the second gives 23 pieces, for a total of 61.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 240 and 144, which is 48 cm. The first ribbon gives 5 pieces and the second gives 3 pieces, for a total of 8.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 252 and 150, which is 6 cm. The first ribbon gives 42 pieces and the second gives 25 pieces, for a total of 67.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
The required length is the GCD of 264 and 156, which is 12 cm. The first ribbon gives 22 pieces and the second gives 13 pieces, for a total of 35.
The greatest common divisor is the largest length that divides both ribbon lengths exactly.
"The World of Algorithms - New Edition" is a topic of the chapter "The World of Algorithms - New Edition" in Class 9 Mathematics. It has 150 practice MCQs and 100 written questions with model answers.
An algorithm is presented as a systematic procedure for solving a problem. The chapter begins with addition and asks not only how to perform an operation, but also why the procedure works and how the amount of work changes with the size of the numbers.…
Read the full notes →Key Idea
See the whole chapter: The World of Algorithms - New Edition →