The World of Algorithms — Class 9 MCQs with Answers
Class 9 CBSE Mathematics · Chapter 11
11 timed quizzes · Easy, Medium and Hard · Updated
Jump to the 6 solved questions
Practise the most important Class 9 CBSE Mathematics questions from Chapter 11, "The World of Algorithms". You get 11 timed quizzes of NCERT-based MCQs, with answers and explanations. The questions are split into Easy, Medium and Hard. Warm up on the basics, then move on to the exam-level questions that top scorers in CBSE Board exams and the JEE & NEET foundation years get right.
To score well in "The World of Algorithms", focus on fast problem-solving, formula recall and step-by-step working. Each MCQ here is timed and uses exam-style marking (+4 correct, −1 wrong, 0 skipped). This helps you stay accurate when time is short, just as real papers need. Every question has a short explanation, so a wrong answer becomes a quick lesson. It is the fastest way to fix gaps before a test.
Use this chapter for focused revision. Start with the Easy set to check your basics on The World of Algorithms, then move to Medium and Hard to practise applying them. Your accuracy, streaks and XP save automatically. This chapter also adds to your overall Class 9 Mathematics mastery score. Try the 6 sample questions below: tap an option to see the answer and a worked explanation. Sign in free to start practising.
The World of Algorithms — important questions & MCQs with answers (Class 9 Mathematics)
6 solved questions from this chapter's difficulty levels, each with its answer and explanation. Tap an option to check yourself.
0 of 6 answered
- Q1 of 6Easy
In this chapter, what is an algorithm?
Show answerHide answer
Answer: A step-by-step procedure to arrive at an answer
Explanation: The chapter calls an algorithm a step-by-step procedure to arrive at an answer, written as precisely as possible. A formula or a memorised table is not a list of steps to follow.
- Q2 of 6Easy
The algorithm to find the divisors of n checks which numbers j?
Show answerHide answer
Answer: Every j in 1, 2, 3, …, n
Explanation: The algorithm checks each j from 1 to n and adds j to list-of-divisors if j divides n. Skipping 1 and n, or checking only primes, would miss divisors.
- Q3 of 6Medium
We combine the two scans into one and run j from 1 to max(m, n). For m = 96 and n = 150, how many values of j are checked?
Show answerHide answer
Answer: 150
Explanation: One combined scan runs up to max(96, 150) = 150. 246 = 96 + 150 is the count for two separate scans.
- Q4 of 6Medium
Assertion (A): For m ≥ n, gcd(m, n) = gcd(n, m − n). Reason (R): Every common divisor of m and n is also a common divisor of n and m − n, and the converse is also true.
Show answerHide answer
Answer: Both A and R are true and R is the correct explanation of A
Explanation: Both are true. The two pairs have exactly the same set of common divisors, so their greatest common divisors are equal; R explains A.
- Q5 of 6Hard
Find gcd(4284, 1890) with Āryabhaṭa's division algorithm. Which line gives the remainders in order and the gcd?
Show answerHide answer
Answer: 504, 378, 126, 0; gcd 126
Explanation: 4284 = 2 × 1890 + 504, 1890 = 3 × 504 + 378, 504 = 1 × 378 + 126, 378 = 3 × 126 + 0, so the gcd is the last non-zero remainder, 126. The numbers 2, 3, 1, 3 are the quotients.
- Q6 of 6Hard
Assertion (A): An algorithm prime(n) that reports n as prime only when divisors(n) has exactly two entries will report that 91 is not prime. Reason (R): A step in an algorithm may be conditional, for example adding j to the list of divisors only if j divides n.
Show answerHide answer
Answer: Both A and R are true but R is not the correct explanation of A
Explanation: Both are true. divisors(91) = [1, 7, 13, 91] has four entries, so 91 is not prime. R is a general fact about how algorithms are written and does not explain why 91 fails the test.
The World of Algorithms notes: key concepts (Class 9 Mathematics)
An algorithm is a step-by-step procedure to get an answer. The chapter writes out column addition, builds a gcd algorithm from the definition and makes it faster, then meets Euclid's subtraction algorithm and Āryabhaṭa's quicker division algorithm, asking each time why a method is correct and how much work it needs.
- Algorithm
- A step-by-step procedure to arrive at an answer, built from basic steps we can already do, such as adding single digits or checking whether one number divides another. Some steps repeat, and some are done only if a condition holds.
- Digit-by-digit addition
- Write the numbers with digits lined up from the right, add each column from right to left with a carry, and at the end write a final carry of 1 if there is one (Step 5). Leaving out Step 5 turns 586 + 739 into 325.
- Carrying and why it works
- Ten units make a new ten, which is carried to the tens group, so adding units, tens, hundreds separately gives the right sum. A column sum is at most 9 + 9 + 1 = 19, so the carry is only 0 or 1, and a sum of exactly 10 must also give a carry.
- Efficiency: digits versus value
- Counting dots grows with the value (3 to 4 digits means 10 times the dots), but the column method needs only one more column. One dot per second makes 33 + 27 take a minute, while 15 s per column takes about half a minute.
- divisors(n) and lists
- Start with an empty list-of-divisors and, for each j = 1, 2, …, n, add j if it divides n. The list comes out in increasing order, e.g. divisors(18) = [1, 2, 3, 6, 9, 18].
- First gcd algorithm
- Find divisors(m) and divisors(n), put each divisor of m that is also in divisors(n) into common-divisors, and report the rightmost element. For 375 and 825 the list is [1, 3, 5, 15, 25, 75], so the gcd is 75.
- Data structure
- Names such as list-of-divisors and j let the steps refer to values kept along the way. A list kept in increasing order is an example of a data structure, a way to organise information so the algorithm works well.
- Improving the gcd scan
- Two separate scans check m + n numbers; one combined scan checks max(m, n); checking only for common divisors needs just 1 to min(m, n). The no-list version starts most-recent-common-divisor at 1 and updates it for each k from 2 to min(m, n) that divides both.
- Analysing the scan
- Each refinement saves work but computes the same value, so it stays correct. The work still grows with the value of min(m, n): going from 3 to 5 digits makes it about 100 times bigger.
- Euclid's subtraction algorithm
- For m ≥ n, gcd(m, n) = gcd(n, m − n): if m = ad and n = bd then m − n = (a − b)d, and the converse uses m = n + (m − n). Reverse the pair when m < n and stop at gcd(m, 0) = m (375 and 825 need 7 reductions).
- Subtraction can be slow
- gcd(2k + 1, 2) needs about k reductions, e.g. gcd(99, 2) goes 97, 95, 93, … down to gcd(1, 0). So the work grows with the value, not with the number of digits.
- Āryabhaṭa's division algorithm
- Āryabhaṭa's Āryabhaṭīya (499 CE) uses the long division method: replace gcd(m, n) by gcd(n, m mod n), where m mod n is the remainder. gcd(99, 2) now needs only 2 reductions, and the number of reductions grows with the number of digits.
- Al-Khwārizmī and the word 'algorithm'
- Al-Khwārizmī (780–850 CE), at the House of Wisdom in Baghdad, explained Indian numerals and the four operations around 820 CE. The Latin form of his name, Algoritmi, gave algorismus, then algorism and algorithm.
- Writing new algorithms
- prime(n) can check that divisors(n) has exactly two entries, and primedivisors(n) keeps only the primes in divisors(n). A prime factorisation such as 180 = 2² × 3² × 5¹ can be stored as pairs of prime and power.
Start this chapter free
You have 6 to try above. Sign in with Google (no card needed). You get 1 Easy + 1 Medium quiz on every chapter, free for good (up to 6 quizzes a day) — plus a free Hard quiz when you score 70%+ on a Medium quiz (1 per subject), and the formulas & exam tips.
This chapter has 11 timed quizzes — Easy, Medium and Hard — with timed scoring and instant feedback. The rest unlock with the ₹999/year plan.
Start with the questions above. The full quiz opens here after.
The World of Algorithms — FAQs
What are the key concepts in Class 9 Mathematics The World of Algorithms?+
An algorithm is a step-by-step procedure to get an answer. The chapter writes out column addition, builds a gcd algorithm from the definition and makes it faster, then meets Euclid's subtraction algorithm and Āryabhaṭa's quicker division algorithm, asking each time why a method is correct and how much work it needs. Key ideas include Algorithm, Digit-by-digit addition, Carrying and why it works, Efficiency: digits versus value, divisors(n) and lists, First gcd algorithm.
What does Class 9 Mathematics Chapter 11 (The World of Algorithms) cover on XamBaaz?+
It has 11 timed quizzes of NCERT-based MCQs on "The World of Algorithms", at Easy, Medium and Hard levels, and you never get the same set twice. Every question has an instant explanation. They help you prepare for CBSE Board exams and the JEE & NEET foundation years.
Are these "The World of Algorithms" questions free to practise?+
Yes. Sign in with Google to practise "The World of Algorithms" free. Full unlimited access is ₹999/year. One year from the day you pay. You stay in Class 9 till 31 March; on 1 April your account moves up to Class 10 and the rest of your year carries over. No chapter is charged separately.
How should I revise "The World of Algorithms" for the exam?+
Start with the Easy quiz to check your basics, then try Medium and Hard to practise applying them. There are 11 timed quizzes on this chapter, so you can come back for a fresh set instead of one you have seen. Read each explanation, retry the questions you miss, and track your accuracy until it stays high.
Are these "The World of Algorithms" MCQs available with answers?+
Yes. 6 sample questions are on this page with answers: tap an option, or "Show answer", to see the correct option and a step-by-step explanation. Sign in free with Google to start practising, with instant scoring.
Is there negative marking in the "The World of Algorithms" quizzes?+
Yes. The timed quizzes use exam-style marking: +4 for a right answer, −1 for a wrong one and 0 for a skip. MHT-CET and CBSE board papers have no negative marking. Our mocks for those are scored their way.
What are the important questions from The World of Algorithms (Class 9 Mathematics)?+
The questions that matter most test Algorithm, Digit-by-digit addition, Carrying and why it works, Efficiency: digits versus value, divisors(n) and lists, First gcd algorithm. This page shows 6 solved important MCQs with answers and explanations. Sign in to practise this chapter as timed quizzes.
Is there an online quiz for The World of Algorithms?+
Yes — Class 9 Mathematics The World of Algorithms has timed online quizzes at Easy, Medium and Hard levels, with instant scoring and a worked explanation on every question. The first quiz on the chapter is free.
Are there question answers and extra questions for The World of Algorithms (Class 9 Mathematics)?+
Yes. This page has 6 solved questions on The World of Algorithms, each with the correct answer and a short explanation. Sign in to practise this chapter as timed quizzes.
Are there assertion–reason and case study questions for The World of Algorithms (Class 9 Mathematics)?+
Yes. The The World of Algorithms question bank has assertion–reason questions and case-based (case study) questions in the CBSE board format, alongside the regular MCQs. Each comes with the answer and a worked explanation. Sign in to practise them in timed quizzes.
