Why Math and Number Theory Appear in DSA Problems in DSA C++ - Test Your Knowledge

Practice - 5 Tasks

1fill in blank

easy

Complete the code to calculate the greatest common divisor (GCD) of two numbers using Euclid's algorithm.

DSA C++

int gcd(int a, int b) {
    while (b != 0) {
        int temp = b;
        b = a [1] b;
        a = temp;
    }
    return a;
}

Drag options to blanks, or click blank then click option'

A%

B/

C-

D+

Attempts:

3 left

💡 Hint

Common Mistakes

Using division (/) instead of modulo (%) causes incorrect results.

Using subtraction (-) instead of modulo (%) is less efficient.

The modulo operator (%) gives the remainder, which is used in Euclid's algorithm to find the GCD.

2fill in blank

medium

Complete the code to check if a number is prime by testing divisibility up to its square root.

DSA C++

bool isPrime(int n) {
    if (n <= 1) return false;
    for (int i = 2; i <= [1]; i++) {
        if (n % i == 0) return false;
    }
    return true;
}

Drag options to blanks, or click blank then click option'

An / 2

Bsqrt(n)

Cn - 1

Dn / 3

Attempts:

3 left

💡 Hint

Common Mistakes

Checking divisibility up to n-1 is inefficient.

Checking only up to n/2 is more work than needed.

Checking divisibility up to the square root of n is enough to determine primality efficiently.

3fill in blank

hard

Fix the error in the modular exponentiation function to correctly compute (base^exp) % mod.

DSA C++

long long modExp(long long base, long long exp, long long mod) {
    long long result = 1;
    base = base % mod;
    while (exp > 0) {
        if (exp [1] 1) {
            result = (result * base) % mod;
        }
        base = (base * base) % mod;
        exp = exp / 2;
    }
    return result;
}

Drag options to blanks, or click blank then click option'

A==

B|

C&

D^

Attempts:

3 left

💡 Hint

Common Mistakes

Using '==' compares equality but does not check oddness efficiently.

Using '^' or '|' does not correctly test oddness.

The bitwise AND (&) with 1 checks if the exponent is odd, which is essential in modular exponentiation.

4fill in blank

hard

Fill both blanks to create a dictionary comprehension that maps numbers to their squares only if the number is even.

DSA C++

{num: num[1]2 for num in range(1, 11) if num [2] 2 == 0}

Drag options to blanks, or click blank then click option'

A**

B%

C//

D*

Attempts:

3 left

💡 Hint

Common Mistakes

Using '*' instead of '**' for power.

Using '//' instead of '%' for checking evenness.

Use '**' for exponentiation and '%' to check if a number is even (remainder zero).

5fill in blank

hard

Fill all three blanks to create a dictionary comprehension that maps uppercase letters to their ASCII codes only if the code is greater than 65.

DSA C++

{ [1]: [2] for [3] in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' if ord([3]) > 65 }

Drag options to blanks, or click blank then click option'

Aletter

Bord(letter)

Dchar

Attempts:

3 left

💡 Hint

Common Mistakes

Using different variable names inconsistently.

Not using ord() to get ASCII codes.

Use 'letter' as the key, 'ord(letter)' as the value, and 'letter' as the loop variable to map letters to ASCII codes.

Practice

1. Why do many Data Structures and Algorithms problems involve concepts from math and number theory?

easy

A. Because math slows down algorithm performance

B. Because math is only used for graphical user interfaces

C. Because number theory is unrelated to algorithms

D. Because math helps analyze problem constraints and optimize solutions

Solution

1. Step 1: Understand the role of math in DSA

   Math provides tools to analyze problem constraints, such as time complexity and correctness.

2. Step 2: Connect number theory to optimization

   Number theory concepts like divisibility and primes help solve problems efficiently by reducing complexity.

3. Final Answer:

   Because math helps analyze problem constraints and optimize solutions -> Option D

4. Quick Check:

   Math aids optimization = D [OK]

Hint: Math helps optimize and analyze algorithms fast [OK]

Common Mistakes:

• Thinking math is only for UI or graphics
• Ignoring number theory's role in optimization
• Assuming math slows down algorithms

2. Which of the following is the correct syntax to check if a number n is divisible by 3 in C++?

easy

A. if (n % 3 == 0) { /* divisible */ }

B. if (n / 3 == 0) { /* divisible */ }

C. if (n % 3 = 0) { /* divisible */ }

D. if (n % 3 != 0) { /* divisible */ }

Solution

1. Step 1: Understand modulus operator usage

   The modulus operator (%) gives the remainder. If remainder is 0, number is divisible.

2. Step 2: Check correct comparison syntax

   Use '==' to compare, '=' is assignment and incorrect here.

3. Final Answer:

   if (n % 3 == 0) { /* divisible */ } -> Option A

4. Quick Check:

   Use % and == for divisibility check [OK]

Hint: Use n % divisor == 0 to check divisibility [OK]

Common Mistakes:

• Using single '=' instead of '=='
• Using division '/' instead of modulus '%'
• Checking for '!= 0' instead of '== 0'

3. What is the output of the following C++ code?

int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

int main() {
    std::cout << gcd(48, 18);
    return 0;
}

medium

A. 18

B. 6

C. 12

D. 3

Solution

1. Step 1: Understand gcd function using Euclid's algorithm

   The function recursively computes gcd by replacing (a, b) with (b, a % b) until b is 0.

2. Step 2: Trace gcd(48, 18)

   gcd(48,18) -> gcd(18, 48%18=12) -> gcd(12, 18%12=6) -> gcd(6, 12%6=0) -> returns 6.

3. Final Answer:

   6 -> Option B

4. Quick Check:

   gcd(48,18) = 6 [OK]

Hint: Trace Euclid's gcd steps to find output [OK]

Common Mistakes:

• Confusing modulus operation results
• Stopping recursion too early
• Mixing up parameters in recursive call

4. Find the error in this C++ code snippet that tries to check if a number is prime:

bool isPrime(int n) {
    for (int i = 2; i <= n / 2; i++) {
        if (n % i == 0) return false;
    }
    return true;
}

medium

A. The function does not handle n <= 1 cases

B. The loop should run until i < n, not n / 2

C. The modulus operator is used incorrectly

D. The return type should be int, not bool

Solution

1. Step 1: Analyze loop correctness

   Loop from 2 to n/2 is valid for checking factors; no error here.

2. Step 2: Check edge cases for input n

   Function does not check if n is less than or equal to 1, which are not prime numbers.

3. Final Answer:

   The function does not handle n <= 1 cases -> Option A

4. Quick Check:

   Check n <= 1 before loop [OK]

Hint: Always check n <= 1 before prime checks [OK]

Common Mistakes:

• Ignoring edge cases like n=0 or n=1
• Changing loop range unnecessarily
• Misusing modulus operator

5. You want to find the number of integers between 1 and 1000 that are divisible by 3 or 5 but not both. Which math concept helps solve this efficiently?

hard

A. Pythagorean Theorem

B. Fermat's Little Theorem

C. Inclusion-Exclusion Principle

D. Binary Search Algorithm

Solution

1. Step 1: Understand the problem of counting divisible numbers

   We need to count numbers divisible by 3 or 5 but exclude those divisible by both.

2. Step 2: Apply Inclusion-Exclusion Principle

   This principle counts elements in unions by adding individual counts and subtracting intersections to avoid double counting.

3. Step 3: Calculate counts

   Count divisible by 3, count divisible by 5, subtract twice the count divisible by 15 (both 3 and 5) to get exclusive count.

4. Final Answer:

   Inclusion-Exclusion Principle -> Option C

5. Quick Check:

   Use Inclusion-Exclusion for overlapping sets [OK]

Hint: Use Inclusion-Exclusion to count overlapping sets [OK]

Common Mistakes:

• Counting divisible by 3 and 5 separately without adjustment
• Using unrelated math theorems
• Forgetting to exclude numbers divisible by both