Notes, Tests & AI Tutor for Class 5–12 | CBSE · JEE · NEET | 24x7 Access
Home Schools
Log in Get Started
Subjective Questions

The World of Algorithms

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.

1 Use the digit-by-digit addition algorithm to add 473 and 695. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1168.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

2 Use the digit-by-digit addition algorithm to add 510 and 724. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1234.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

3 Use the digit-by-digit addition algorithm to add 547 and 753. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1300.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

4 Use the digit-by-digit addition algorithm to add 584 and 782. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1366.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

5 Use the digit-by-digit addition algorithm to add 621 and 811. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1432.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

6 Use the digit-by-digit addition algorithm to add 658 and 840. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1498.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

7 Use the digit-by-digit addition algorithm to add 695 and 869. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1564.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

8 Use the digit-by-digit addition algorithm to add 732 and 898. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1630.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

9 Use the digit-by-digit addition algorithm to add 769 and 927. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1696.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

10 Use the digit-by-digit addition algorithm to add 806 and 956. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1762.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

11 Use the digit-by-digit addition algorithm to add 843 and 985. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1828.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

12 Use the digit-by-digit addition algorithm to add 880 and 1014. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1894.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

13 Use the digit-by-digit addition algorithm to add 917 and 1043. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 1960.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

14 Use the digit-by-digit addition algorithm to add 954 and 1072. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 2026.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

15 Use the digit-by-digit addition algorithm to add 991 and 1101. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 2092.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

16 Use the digit-by-digit addition algorithm to add 1028 and 1130. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 2158.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

17 Use the digit-by-digit addition algorithm to add 1065 and 1159. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 2224.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

18 Use the digit-by-digit addition algorithm to add 1102 and 1188. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 2290.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

19 Use the digit-by-digit addition algorithm to add 1139 and 1217. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 2356.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

20 Use the digit-by-digit addition algorithm to add 1176 and 1246. Show the column totals and the final sum. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • Final sum = 2422.
Explanation

The carry transfers the extra tens from one column to the next, preserving place value.

21 Find the greatest common divisor of 84 and 36. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

22 Find the greatest common divisor of 90 and 40. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

23 Find the greatest common divisor of 96 and 44. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

24 Find the greatest common divisor of 102 and 48. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

25 Find the greatest common divisor of 108 and 52. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

26 Find the greatest common divisor of 114 and 56. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

27 Find the greatest common divisor of 120 and 60. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

28 Find the greatest common divisor of 126 and 64. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

29 Find the greatest common divisor of 132 and 68. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

30 Find the greatest common divisor of 138 and 72. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

31 Find the greatest common divisor of 144 and 76. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

32 Find the greatest common divisor of 150 and 80. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

33 Find the greatest common divisor of 156 and 84. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

34 Find the greatest common divisor of 162 and 88. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

35 Find the greatest common divisor of 168 and 92. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

36 Find the greatest common divisor of 174 and 96. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

37 Find the greatest common divisor of 180 and 100. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

38 Find the greatest common divisor of 186 and 104. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

39 Find the greatest common divisor of 192 and 108. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

40 Find the greatest common divisor of 198 and 112. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

41 Find the greatest common divisor of 204 and 116. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

42 Find the greatest common divisor of 210 and 120. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

43 Find the greatest common divisor of 216 and 124. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

44 Find the greatest common divisor of 222 and 128. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

45 Find the greatest common divisor of 228 and 132. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

46 Find the greatest common divisor of 234 and 136. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

47 Find the greatest common divisor of 240 and 140. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

48 Find the greatest common divisor of 246 and 144. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

49 Find the greatest common divisor of 252 and 148. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

50 Find the greatest common divisor of 258 and 152. Show a sequence of divisions or subtractions. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The common divisors are preserved when the larger number is replaced by its remainder after division by the smaller number.

51 List all positive divisors of 20 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

52 List all positive divisors of 21 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

53 List all positive divisors of 22 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

54 List all positive divisors of 23 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

55 List all positive divisors of 24 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

56 List all positive divisors of 25 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

57 List all positive divisors of 26 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

58 List all positive divisors of 27 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

59 List all positive divisors of 28 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

60 List all positive divisors of 29 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

61 List all positive divisors of 30 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

62 List all positive divisors of 31 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

63 List all positive divisors of 32 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

64 List all positive divisors of 33 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

65 List all positive divisors of 34 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

66 List all positive divisors of 35 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

67 List all positive divisors of 36 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

68 List all positive divisors of 37 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

69 List all positive divisors of 38 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

70 List all positive divisors of 39 and state how the list helps in finding a GCD. 2 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

A common divisor divides both numbers without a remainder.

71 What is an algorithm? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

An algorithm is a precisely described, step-by-step procedure for arriving at an answer or completing a task.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

72 Why should the steps of an algorithm be written precisely? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

Precise steps reduce ambiguity and allow the procedure to be followed consistently by different people or by a computer.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

73 Explain the role of carry in the usual addition algorithm. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

A carry records the tens or higher place-value part of a column sum and adds it to the next column on the left.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

74 What is meant by a counterexample in mathematical reasoning? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

A counterexample is a specific case that satisfies the stated conditions but contradicts the claimed conclusion.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

75 Why can listing all divisors be inefficient for large numbers? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

The number of possible candidates grows with the number, so testing every integer can require many unnecessary steps.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

76 Describe the central idea of the Euclidean division algorithm for GCD. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

77 Why does the Euclidean algorithm stop? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

At each non-final step the remainder is a non-negative integer smaller than the divisor. The remainders therefore decrease until zero is reached.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

78 What does the last non-zero remainder represent in the Euclidean algorithm? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

It is the greatest common divisor of the original pair because each division step preserves their common divisors.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

79 How does repeated subtraction find a GCD? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

Repeatedly subtract the smaller positive number from the larger. The common divisors remain unchanged, and equal final values give the GCD.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

80 Why can division be more efficient than repeated subtraction? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

A single division step can remove many repeated subtractions at once by producing a quotient and a smaller remainder.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

81 What is a data structure in the context of an algorithm? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

It is an organised way of storing and arranging information so that an algorithm can access and process it.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

82 Why is it useful to analyse an algorithm? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

Analysis helps estimate the work required as the input grows and allows different procedures to be compared.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

83 Explain why an algorithm should specify its input and output. 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

The input identifies the information to be processed, while the output states the result the procedure must produce.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

84 How can an algorithm be checked for correctness? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

Test it on suitable examples, inspect whether each step follows logically, and verify that the output satisfies the required condition.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

85 Why is a finite sequence of steps important in an algorithm? 3 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

A procedure intended to solve a problem must eventually stop and produce its result rather than continue indefinitely.

Explanation

The answer connects the definition or procedure to its purpose in systematic problem solving.

86 Two ribbons are 96 cm and 72 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 24 cm.
  • (iii) 7 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

87 Two ribbons are 108 cm and 78 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 6 cm.
  • (iii) 31 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

88 Two ribbons are 120 cm and 84 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 12 cm.
  • (iii) 17 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

89 Two ribbons are 132 cm and 90 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 6 cm.
  • (iii) 37 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

90 Two ribbons are 144 cm and 96 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 48 cm.
  • (iii) 5 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

91 Two ribbons are 156 cm and 102 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 6 cm.
  • (iii) 43 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

92 Two ribbons are 168 cm and 108 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 12 cm.
  • (iii) 23 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

93 Two ribbons are 180 cm and 114 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 6 cm.
  • (iii) 49 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

94 Two ribbons are 192 cm and 120 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 24 cm.
  • (iii) 13 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

95 Two ribbons are 204 cm and 126 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 6 cm.
  • (iii) 55 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

96 Two ribbons are 216 cm and 132 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 12 cm.
  • (iii) 29 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

97 Two ribbons are 228 cm and 138 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 6 cm.
  • (iii) 61 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

98 Two ribbons are 240 cm and 144 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 48 cm.
  • (iii) 8 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

99 Two ribbons are 252 cm and 150 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 6 cm.
  • (iii) 67 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

100 Two ribbons are 264 cm and 156 cm long. They are to be cut into equal pieces of the greatest possible length without waste. (i) Which mathematical quantity is needed? (ii) Find it. (iii) How many pieces will be obtained altogether? 4 marks
The World of Algorithms - New Edition › The World of Algorithms - New Edition
Model answer

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.

  • (i) The greatest common divisor.
  • (ii) 12 cm.
  • (iii) 35 pieces.
Explanation

The greatest common divisor is the largest length that divides both ribbon lengths exactly.

About this topic: The World of Algorithms - New Edition

"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.

1New Edition

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 terms

Key Idea

See the whole chapter: The World of Algorithms - New Edition →