1. The mean rating for each metric out of 10 customers is: Food = [(5 × 5) + (4 × 3) + (3 × 2)] / 10 = 43 / 10 = 4.3; Ambience = [(4 × 4) + (3 × 5) + (2 × 1)] / 10 = 33 / 10 = 3.3; Service = [(5 × 1) + (4 × 2) + (3 × 2) + (2 × 4) + (1 × 1)] / 10 = 28 / 10 = 2.8. Combining these using weights 6:5:4 yielRead more

    The mean rating for each metric out of 10 customers is: Food = [(5 × 5) + (4 × 3) + (3 × 2)] / 10 = 43 / 10 = 4.3; Ambience = [(4 × 4) + (3 × 5) + (2 × 1)] / 10 = 33 / 10 = 3.3; Service = [(5 × 1) + (4 × 2) + (3 × 2) + (2 × 4) + (1 × 1)] / 10 = 28 / 10 = 2.8. Combining these using weights 6:5:4 yields [(4.3 × 6) + (3.3 × 5) + (2.8 × 4)] / 15 = 53.5 / 15 ≈ 3.57.

     

    For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 10 How Quantities Combine Understanding Data Question Answer (2026-27)

    https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-10/

     

    See less
    • 48
  2. Successive divisions give: 2587392 = 16 × 157656 + 64896 ⇒ gcd(157656, 64896); 157656 = 2 × 64896 + 27864 ⇒ gcd(64896, 27864); 64896 = 2 × 27864 + 9168 ⇒ gcd(27864, 9168); 27864 = 3 × 9168 + 360 ⇒ gcd(9168, 360); 9168 = 25 × 360 + 168 ⇒ gcd(360, 168); 360 = 2 × 168 + 24 ⇒ gcd(168, 24); 168 = 7 × 24Read more

    Successive divisions give:

    2587392 = 16 × 157656 + 64896 ⇒ gcd(157656, 64896);

    157656 = 2 × 64896 + 27864 ⇒ gcd(64896, 27864);

    64896 = 2 × 27864 + 9168 ⇒ gcd(27864, 9168);

    27864 = 3 × 9168 + 360 ⇒ gcd(9168, 360);

    9168 = 25 × 360 + 168 ⇒ gcd(360, 168);

    360 = 2 × 168 + 24 ⇒ gcd(168, 24);

    168 = 7 × 24 + 0 ⇒ gcd(24, 0).

    Thus, the GCD is 24.

     

    For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 11 The World of Algorithms Question Answer (2026-27)

    https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-11/

    See less
    • 52
  3. Scanning numbers from n down to 1 populates the divisor list in descending order rather than ascending order. Because the largest divisors are added first, the list of common divisors between two numbers will also be ordered from greatest to least. To report the greatest common divisor at the end, tRead more

    Scanning numbers from n down to 1 populates the divisor list in descending order rather than ascending order. Because the largest divisors are added first, the list of common divisors between two numbers will also be ordered from greatest to least. To report the greatest common divisor at the end, the algorithm must select the first, leftmost element rather than the rightmost.

     

    For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 11 The World of Algorithms Question Answer (2026-27)

    https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-11/

    See less
    • 54
  4. Working backwards from min(m, n) down to 1 allows the algorithm to stop early. The very first number encountered that divides both m and n is guaranteed to be the largest common factor. We can immediately report this number as the GCD and terminate the process, completely eliminating the need to exaRead more

    Working backwards from min(m, n) down to 1 allows the algorithm to stop early. The very first number encountered that divides both m and n is guaranteed to be the largest common factor. We can immediately report this number as the GCD and terminate the process, completely eliminating the need to examine the remaining numbers all the way down to 1.

     

    For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 11 The World of Algorithms Question Answer (2026-27)

    https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-11/

    See less
    • 54
  5. Apply the division algorithm starting with the larger number: divide 825 by 375, which leaves a quotient of 2 and remainder 75, reducing the problem to gcd(375, 75). Next, divide 375 by 75, giving a quotient of 5 and remainder 0, reducing to gcd(75, 0). Because the second number is now 0, the algoriRead more

    Apply the division algorithm starting with the larger number: divide 825 by 375, which leaves a quotient of 2 and remainder 75, reducing the problem to gcd(375, 75). Next, divide 375 by 75, giving a quotient of 5 and remainder 0, reducing to gcd(75, 0). Because the second number is now 0, the algorithm halts and reports gcd(375, 825) = 75.

     

    For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 11 The World of Algorithms Question Answer (2026-27)

    https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-11/

    See less
    • 39