Class 9 Maths Chapter 11 MCQ

📐 Class 9 Maths: MCQs with Answers →

1. What is an algorithm?
A) A collection of random numbers
B) A step-by-step procedure to arrive at an answer
C) A geometrical construction
D) A mathematical expression without steps
Answer: B) A step-by-step procedure to arrive at an answer

2. What is the main purpose of an algorithm?
A) To make a problem more complicated
B) To solve a problem through systematic steps
C) To avoid calculations
D) To generate random results
Answer: B) To solve a problem through systematic steps

3. How were numbers initially added before using the place-value method?
A) By multiplication
B) By drawing dots and counting them
C) By division
D) By using a calculator
Answer: B) By drawing dots and counting them

4. In the Indian base-ten addition algorithm, how are numbers arranged?
A) One after another horizontally
B) One below the other, with digits aligned from right to left
C) With the leftmost digits aligned
D) In descending order
Answer: B) One below the other, with digits aligned from right to left

5. In which direction are the columns added in the addition algorithm?
A) Left to right
B) Top to bottom
C) Right to left
D) From the middle outward
Answer: C) Right to left

6. What is the purpose of carrying in addition?
A) To remove unnecessary digits
B) To transfer a newly formed group of ten to the next place-value column
C) To multiply the numbers
D) To change the order of digits
Answer: B) To transfer a newly formed group of ten to the next place-value column

7. What happens when the sum of two digits and the current carry is less than 10?
A) Write the sum and set carry to 1
B) Write the sum and set carry to 0
C) Ignore the sum
D) Multiply the sum by 10
Answer: B) Write the sum and set carry to 0

8. What is done if a carry of 1 remains after all columns have been added?
A) It is discarded
B) It is written to the left of the bottom row
C) It is written above the first number
D) It is added to the rightmost digit
Answer: B) It is written to the left of the bottom row



9. What is an important assumption in the addition algorithm?
A) We know how to multiply two-digit numbers
B) We know how to add single-digit numbers
C) We know how to divide large numbers
D) We know how to calculate square roots
Answer: B) We know how to add single-digit numbers

10. Why is the column method faster than counting individual dots?
A) It avoids using numbers
B) It requires only a few additional columns when the number of digits increases
C) It does not require addition
D) It always produces smaller answers
Answer: B) It requires only a few additional columns when the number of digits increases

11. What does GCD stand for?
A) Greatest Common Division
B) General Common Divisor
C) Greatest Common Divisor
D) Greatest Calculated Digit
Answer: C) Greatest Common Divisor

12. Which term is also used for GCD?
A) Lowest common multiple
B) Highest common factor
C) Least common factor
D) Highest prime number
Answer: B) Highest common factor



13. What is the first step in finding the GCD using the definition?
A) Multiply the two numbers
B) Compute the divisors of both numbers
C) Find the square roots
D) Add the two numbers
Answer: B) Compute the divisors of both numbers

14. What is a divisor of a number?
A) A number that leaves a remainder when dividing it
B) A number that divides it exactly
C) A number greater than it
D) A number that is always prime
Answer: B) A number that divides it exactly

15. In the algorithm for finding divisors of n, what is the initial state of the list of divisors?
A) It contains 1 and n
B) It contains all prime numbers
C) It is empty
D) It contains n only
Answer: C) It is empty

16. In the divisor-finding algorithm, which numbers are checked?
A) Only even numbers
B) Numbers from 1 to n
C) Numbers from n to 100
D) Only prime numbers
Answer: B) Numbers from 1 to n



17. When is a number j added to the list of divisors of n?
A) When j is greater than n
B) When j divides n
C) When j is prime
D) When j is even
Answer: B) When j divides n

18. What is the list of divisors of 18?
A) [1, 2, 3, 6, 9, 18]
B) [1, 2, 4, 6, 18]
C) [2, 3, 6, 9]
D) [1, 3, 5, 9, 18]
Answer: A) [1, 2, 3, 6, 9, 18]

19. Why is the list of divisors generated by the algorithm in increasing order?
A) The divisors are sorted randomly
B) The algorithm checks numbers systematically from 1 to n
C) The algorithm checks only prime numbers
D) The largest divisor is checked first
Answer: B) The algorithm checks numbers systematically from 1 to n

20. What is the list of divisors of 375 given in the chapter?
A) [1, 3, 5, 15, 25, 75, 125, 375]
B) [1, 2, 3, 5, 15, 375]
C) [1, 5, 25, 125, 375]
D) [1, 3, 9, 15, 75, 375]
Answer: A) [1, 3, 5, 15, 25, 75, 125, 375]

21. What is the list of divisors of 825 given in the chapter?
A) [1, 3, 5, 11, 15, 25, 33, 55, 75, 165, 275, 825]
B) [1, 2, 5, 11, 25, 825]
C) [1, 3, 5, 15, 55, 825]
D) [1, 5, 25, 75, 825]
Answer: A) [1, 3, 5, 11, 15, 25, 33, 55, 75, 165, 275, 825]

22. What is the GCD of 375 and 825?
A) 15
B) 25
C) 55
D) 75
Answer: D) 75

23. How is the GCD determined after finding the divisors of two numbers?
A) By adding all divisors
B) By finding the largest divisor common to both lists
C) By multiplying the smallest divisors
D) By subtracting the two lists
Answer: B) By finding the largest divisor common to both lists

24. What is the list of common divisors of 375 and 825?
A) [1, 3, 5, 15, 25, 75]
B) [1, 2, 3, 5, 15]
C) [3, 5, 11, 25, 75]
D) [1, 5, 15, 55, 75]
Answer: A) [1, 3, 5, 15, 25, 75]

25. What is the GCD of 54000 and 81000 according to the chapter?
A) 9000
B) 13500
C) 27000
D) 54000
Answer: C) 27000

26. What is a data structure?
A) A method of drawing geometrical figures
B) A way of organising information to help make an algorithm more efficient
C) A method of multiplying numbers
D) A list of mathematical formulas only
Answer: B) A way of organising information to help make an algorithm more efficient

27. Which of the following is an example of a data structure discussed in the chapter?
A) A list of numbers
B) A circle
C) A triangle
D) A decimal point
Answer: A) A list of numbers

28. Why are names such as divisors-of-m and divisors-of-n used in algorithms?
A) To make the algorithm longer
B) To identify and keep track of intermediate values
C) To remove all calculations
D) To replace the input numbers
Answer: B) To identify and keep track of intermediate values

29. What is the first improvement suggested for the original GCD algorithm?
A) Calculate only prime divisors
B) Compute both lists of divisors together
C) Multiply the two numbers first
D) Ignore common divisors
Answer: B) Compute both lists of divisors together

30. In the improved algorithm, up to which number are possible divisors checked when computing both divisor lists together?
A) m + n
B) min(m, n)
C) max(m, n)
D) m × n
Answer: C) max(m, n)

31. Why can common divisors be checked only up to min(m, n)?
A) A common divisor cannot be greater than the smaller number
B) A common divisor must always be even
C) The larger number has no divisors
D) The smaller number is always prime
Answer: A) A common divisor cannot be greater than the smaller number

32. What is the advantage of directly computing the list of common divisors?
A) It avoids finding the individual divisor lists first
B) It increases the number of calculations
C) It removes the need to compare numbers
D) It changes the definition of GCD
Answer: A) It avoids finding the individual divisor lists first

33. Why does the improved GCD algorithm do away with the list of common divisors?
A) Common divisors are always equal
B) Only the largest common divisor is needed
C) Lists cannot contain numbers
D) The GCD is always 1
Answer: B) Only the largest common divisor is needed

34. What is the initial value of most-recent-common-divisor?
A) 0
B) 1
C) 2
D) min(m, n)
Answer: B) 1

35. When is most-recent-common-divisor updated?
A) Whenever a number divides only m
B) Whenever a number divides only n
C) Whenever a number divides both m and n
D) Whenever a number is prime
Answer: C) Whenever a number divides both m and n

36. What is the GCD of 6 and 12?
A) 2
B) 3
C) 4
D) 6
Answer: D) 6

37. What is the main limitation of the final scanning algorithm for GCD?
A) It requires examining numbers up to min(m, n)
B) It cannot find the GCD of even numbers
C) It works only for prime numbers
D) It requires multiplication of all divisors
Answer: A) It requires examining numbers up to min(m, n)

38. Who is associated with the subtraction algorithm for finding GCD?
A) Aryabhata
B) Euclid
C) Al-Khwarizmi
D) Brahmagupta
Answer: B) Euclid

39. In which book did Euclid write down his GCD algorithm?
A) Āryabhaṭīya
B) Elements
C) Brāhmasphuṭasiddhānta
D) Liber Algorismi
Answer: B) Elements

40. If m is greater than or equal to n, which identity is used in Euclid’s subtraction algorithm?
A) gcd(m, n) = gcd(m + n, n)
B) gcd(m, n) = gcd(n, m – n)
C) gcd(m, n) = gcd(m × n, n)
D) gcd(m, n) = gcd(m, n + 1)
Answer: B) gcd(m, n) = gcd(n, m – n)

41. What is the stopping condition in Euclid’s subtraction algorithm?
A) When m = n + 1
B) When n = 0
C) When m = 0 and n = 0
D) When both numbers are prime
Answer: B) When n = 0

42. What is the GCD of m and 0?
A) 0
B) 1
C) m
D) 2m
Answer: C) m

43. Why can the subtraction algorithm be inefficient for some numbers?
A) It always requires multiplication
B) It may require many repeated subtraction steps
C) It cannot handle odd numbers
D) It does not use common divisors
Answer: B) It may require many repeated subtraction steps

44. What is the example used in the chapter to show the inefficiency of repeated subtraction?
A) gcd(10, 5)
B) gcd(99, 2)
C) gcd(12, 6)
D) gcd(25, 5)
Answer: B) gcd(99, 2)

45. Which Indian mathematician’s division algorithm is discussed in the chapter?
A) Brahmagupta
B) Aryabhata
C) Bhaskara II
D) Virahanka
Answer: B) Aryabhata

46. In which work of Aryabhata is the division method mentioned?
A) Elements
B) Āryabhaṭīya
C) Brāhmasphuṭasiddhānta
D) Vṛttajātisamuchaya
Answer: B) Āryabhaṭīya

47. What does m mod n represent?
A) The quotient when m is divided by n
B) The remainder when m is divided by n
C) The product of m and n
D) The difference between m and n
Answer: B) The remainder when m is divided by n

48. In the improved division algorithm, gcd(m, n) is reduced to:
A) gcd(m + n, n)
B) gcd(n, m mod n)
C) gcd(m × n, n)
D) gcd(m – n, m)
Answer: B) gcd(n, m mod n)

49. According to the chapter, around which year did Al-Khwarizmi write his treatise explaining Indian numerals and arithmetic procedures?
A) 499 CE
B) 628 CE
C) 820 CE
D) 1000 CE
Answer: C) 820 CE

50. According to the chapter, the word “algorithm” ultimately developed from:
A) Euclid’s Greek name
B) Al-Khwarizmi’s Latinised name, Algoritmi
C) Aryabhata’s Sanskrit name
D) The word arithmetic
Answer: B) Al-Khwarizmi’s Latinised name, Algoritmi

📐 Class 9 Maths: MCQs with Answers →

Satyam Kharwar is a teacher and the owner of NotesWave.in, providing simple, NCERT-aligned study materials for Classes 6–12.

Leave a Comment