Practicing Class 9 Maths MCQ and Ganita Manjari Class 9 Maths Chapter 10 The World of Algorithms MCQ Questions Online Test with Answers daily helps in time management.
MCQ on The World of Algorithms Class 9
The World of Algorithms MCQ Class 9
Class 9 Maths The World of Algorithms MCQ
Question 1.
An algorithm is best described as:
(a) A computer program written in any language
(b) A step-by-step procedure to solve a problem
(c) A collection of numbers
(d) A mathematical formula only
Answer:
(b) A step-by-step procedure to solve a problem
Explanation:
An algorithm is a systematic, step-by-step procedure used to solve a problem.
Hence, (b) is the correct answer.
Question 2.
In Euclid’s subtraction algorithm, if m > n, then:
(a) gcd(m, n) = gcd(n, m – n)
(b) gcd(m, n) = m + n
(c) gcd(w, n) = m × n
(d) gcd(m, n) = \(\frac{m}{n}\)
Answer:
(a) gcd(m, n) = gcd(n, m – n)
Explanation:
Euclid’s subtraction algorithm repeatedly replaces the greater number with the difference between the two numbers.
For a set of divisors (say m, n) where m > n, Euclid’s algorithm for gcd (m, n):
- If m < n, reverse the numbers and compute gcd (n, m)
- If n = 0, report the answer as m
- Otherwise, reduce the problem to compute gcd (n, m – n)
Hence, (a) is the correct answer.
![]()
Question 3.
Assuming m ≥ n, Euclid’s subtraction algorithm reduces GCD(m, n) to
(a) GCD(n, m + n)
(b) GCD(n, m – n)
(c) GCD (m, n – m)
(d) GCD (m × n, 1)
Answer:
(b) GCD(n, m – n)
Explanation:
For m ≥ n, Euclid’s subtraction algorithm uses GCD(m, n) – GCD(n, m-n).
Therefore, the problem is reduced to GCD(n, m-n).
Question 4.
In Euclid’s subtraction algorithm, ifm<n Step 1 asks us to
(a) stop and report m
(b) add the two numbers
(c) subtract m from n and stop
(d) swap the numbers and compute GCD(n, m)
Answer:
(d) swap the numbers and compute GCD(n, m)
Explanation:
If m < n the numbers are interchanged so that the larger number comes first.
Thus, we compute GCD(n, m).
Question 5.
In Euclid’s or Aryabhata’s algorithm, once n = 0 is reached, the GCD is reported as
(a) 0
(b) n
(c) m
(d) 1
Answer:
(c) m
Explanation:
The stopping condition is reached when n = 0. Then, GCD(m, 0) = m.
Question 6.
The value of 47 mod 6 is
(a) 1
(b) 5
(c) 7
(d) 11
Answer:
(b) 5
Explanation:
By Aryabhata’s division algorithm,
47 = 6 × 7 + 5.
Therefore, the remainder when 47 is divided by 6 is 5, i.e. 47 mod 6 = 5.
Question 7.
Assuming m ≥ n and n ≠ 0, Aryabhata’s division algorithm reduces GCD(m, n) to
(a) GCD (n, m mod n)
(b) GCD (m mod n, n)
(c) GCD (n, m + n)
(d) GCD(m, n mod m)
Answer:
(a) GCD (n, m mod n)
Explanation:
Aryabhata’s division algorithm replaces Euclids repeated subtraction by the remainder on division.
Hence, GCD(m, n) is reduced to GCD(n, m mod n).
Question 8.
Using Aryabhata’s division algorithm, GCD(84, 36) is
(a) 12
(b) 18
(c) 24
(d) 6
Answer:
(a) 12
Explanation:
Applying the Aryabhata’s division algorithm.
84 = 36 × 2 + 12
36 = 12 × 3 + 0
Since, the last non-zero remainder is 12.
Question 9.
The number of steps needed is proportional to the number of digits (rather than the value) of the numbers in
(a) adding by counting dots
(b) Euclid’s subtraction algorithm
(c) Aryabhata’s division algorithm
(d) the list-comparison GCD algorithm
Answer:
(c) Aryabhata’s division algorithm
Explanation:
In Aryabhata’s division algorithm, repeated division by the remainder reduces the numbers quickly.
The number of reductions is proportional to the number of digits rather than the value of the numbers.
Question 10.
The modern word ‘algorithm’ is derived from the Latinised name of
(a) Euclid
(b) Aryabhata
(c) Al-Khwarizmi
(d) Pythagoras
Answer:
(c) Al-Khwarizmi
Explanation:
The word ‘algorithm’ developed from Algoritmi, which is the Latinised form of Al-Khwarizm’i’s name.
The World of Algorithms Class 9 Assertion and Reason Questions
Two statements are given, one labelled as Assertion (A) and the other labelled as Reason (R). Select the correct answer from the options (a), (b), (c), and (d) given below.
(a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
(b) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A).
(c) Assertion (A) is true, but Reason (R) is false.
(d) Assertion (A) is false, but Reason (R) is true.
Question 1.
Assertion (A): An algorithm must have clearly defined steps.
Reason(R): A person should be able to execute each step of an algorithm without confusion.
Answer:
(a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
Explanation:
An algorithm consists of precise steps so that it can be executed correctly.
Question 2.
Assertion (A): Euclid’s division algorithm requires fewer steps than the subtraction algorithm.
Reason (R): Division reduces the problem size faster by using remainders.
Answer:
(a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
Explanation:
Euclid’s division algorithm uses division and remainder to reduce the numbers quickly. In contrast, Euclid’s subtraction algorithm repeatedly subtracts the smaller number from the larger number, which may require many more steps. Therefore, using remainders makes the division algorithm more efficient.