Class 9 · MathsNCERT 2026 Revised Syllabus
Chapter 11: The World of Algorithms (0904CH11)
Exercise Set 11.2 — 3 questions with step-by-step notebook-style answers.
Jump to:
Exercise Set 11.2(3 questions)
1
Suppose List 1 and List 2 are two lists of numbers in increasing order:(i) Write an algorithm to find elements in List 1 that are not present in List 2.(ii) Write an algorithm to find elements in List 2 that are not present in List 1.
School Level Solution
2
Describe an algorithm to compute the least common multiple (lcm) of two numbers.
School Level Solution
3
Divisors occur in pairs. For instance, the divisors of 18 are (1, 18), (2, 9) and (3, 6).(i) If we write out divisors in pairs, how many numbers do we have to examine between 1 and n to find all the divisors of n?(ii) If we list out the divisors in pairs, will our gcd algorithm still work in the manner we have described?
School Level Solution
$\dfrac{n}{j}$. At least one of the pair is at most √n, since if both were larger their product would exceed n. Therefore check j=1,2,…,⌊√n⌋. Whenever j divides n, record both j and $\dfrac{n}{j}$ (record only one copy if j=√n).(ii) Yes, the common-divisor method still works if the divisors are paired. However, the list may no longer be in increasing order. So one cannot automatically report the rightmost/last common divisor as the gcd; instead compare all common divisors and report the largest, or use a descending search that stops at the first common divisor.