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

Practice - 5 Tasks

1fill in blank

easy

Complete the code to calculate the remainder when dividing two numbers.

DSA Javascript

function mod(a, b) {
  return a [1] b;
}

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

A+

B*

C%

D-

Attempts:

3 left

💡 Hint

Common Mistakes

Using + or * instead of % causes wrong results.

The modulo operator % gives the remainder of division, which is often used in number theory problems.

2fill in blank

medium

Complete the code to check if a number is even.

DSA Javascript

function isEven(n) {
  return n [1] 2 === 0;
}

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 %.

Using % 2 === 0 checks if the number divides evenly by 2, meaning it is even.

3fill in blank

hard

Fix the error in the function that calculates the greatest common divisor (GCD) using Euclid's algorithm.

DSA Javascript

function gcd(a, b) {
  if (b === 0) return a;
  return gcd(b, a [1] b);
}

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

A*

B/

C-

D%

Attempts:

3 left

💡 Hint

Common Mistakes

Using division or subtraction instead of modulo causes incorrect recursion.

Euclid's algorithm uses the modulo operator % to find the remainder for the recursive step.

4fill in blank

hard

Fill both blanks to create a function that returns all prime numbers up to n.

DSA Javascript

function primesUpTo(n) {
  const primes = [];
  for (let i = 2; i [1] n; i++) {
    let isPrime = true;
    for (let j = 2; j [2] i; j++) {
      if (i % j === 0) {
        isPrime = false;
        break;
      }
    }
    if (isPrime) primes.push(i);
  }
  return primes;
}

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

A<=

B<

C>

D>=

Attempts:

3 left

💡 Hint

Common Mistakes

Using > or >= causes loops to run incorrectly.

The outer loop iterates from 2 up to n inclusive using <=. The inner loop checks divisors from 2 up to but not including i using <.

5fill in blank

hard

Fill all three blanks to create a function that returns a dictionary of numbers and their squares for numbers greater than 3.

DSA Javascript

function squaresDict(numbers) {
  return numbers.reduce((acc, num) => {
    if (num [1] 3) {
      acc[[2]] = [3];
    }
    return acc;
  }, {});
}

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

A>

Bnum

Cnum * num

D<=

Attempts:

3 left

💡 Hint

Common Mistakes

Using <= instead of > causes wrong filtering.

Swapping key and value causes incorrect dictionary.

The function checks if num > 3, then sets the key as num and value as num * num in the dictionary.

Practice

1. Why do math and number theory concepts often appear in data structures and algorithms problems?

easy

A. Because they help solve problems involving patterns, divisibility, and optimization

B. Because they are only used for sorting algorithms

C. Because they replace the need for loops in code

D. Because they are only relevant for graphical user interfaces

Solution

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

   Math and number theory provide tools to analyze patterns, divisibility, and optimize solutions efficiently.

2. Step 2: Identify incorrect options

   Options B, C, and D are incorrect because math is not limited to sorting, does not replace loops, and is unrelated to UI design.

3. Final Answer:

   Because they help solve problems involving patterns, divisibility, and optimization -> Option A

4. Quick Check:

   Math aids problem-solving in DSA = Because they help solve problems involving patterns, divisibility, and optimization [OK]

Hint: Math helps find patterns and optimize solutions fast [OK]

Common Mistakes:

• Thinking math is only for sorting
• Believing math replaces loops
• Confusing UI with algorithm concepts

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

easy

A. if (n mod 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: Recall JavaScript modulus operator

   The modulus operator is %, used to find remainder. Checking n % 3 == 0 tests divisibility by 3.

2. Step 2: Identify syntax errors in other options

   if (n / 3 == 0) { /* divisible */ } uses division instead of modulus. if (n % 3 = 0) { /* divisible */ } uses assignment = instead of comparison ==. if (n mod 3 == 0) { /* divisible */ } uses invalid keyword mod.

3. Final Answer:

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

4. Quick Check:

   Use % for remainder check = if (n % 3 == 0) { /* divisible */ } [OK]

Hint: Use % operator to check divisibility in JavaScript [OK]

Common Mistakes:

• Using = instead of == for comparison
• Using division instead of modulus
• Using invalid keywords like mod

3. What is the output of the following JavaScript code?

function gcd(a, b) {
  while (b !== 0) {
    let temp = b;
    b = a % b;
    a = temp;
  }
  return a;
}
console.log(gcd(48, 18));

medium

A. 18

B. 12

C. 6

D. 3

Solution

1. Step 1: Understand the gcd function

   This function uses the Euclidean algorithm to find the greatest common divisor (GCD) of two numbers.

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

   Iteration 1: a=48, b=18; temp=18; b=48%18=12; a=18
   Iteration 2: a=18, b=12; temp=12; b=18%12=6; a=12
   Iteration 3: a=12, b=6; temp=6; b=12%6=0; a=6
   Loop ends, return a=6.

3. Final Answer:

   6 -> Option C

4. Quick Check:

   GCD of 48 and 18 = 6 [OK]

Hint: Use Euclidean algorithm steps to find GCD quickly [OK]

Common Mistakes:

• Confusing modulus with division
• Not updating variables correctly in loop
• Returning wrong variable at end

4. Find the error in this JavaScript function that tries to check if a number is prime:

function isPrime(n) {
  if (n <= 1) return false;
  for (let i = 2; i < n; i++) {
    if (n % i = 0) return false;
  }
  return true;
}

medium

A. The loop should start from 1 instead of 2

B. The comparison operator in the if condition is incorrect

C. The function should return true for n <= 1

D. The loop should run until i <= n

Solution

1. Step 1: Check the if condition inside the loop

   The condition uses = which is assignment, not comparison. It should be == or ===.

2. Step 2: Verify other parts

   Loop starting at 2 is correct. Returning false for n <= 1 is correct. Loop running until i < n is correct for prime check.

3. Final Answer:

   The comparison operator in the if condition is incorrect -> Option B

4. Quick Check:

   Use == or === for comparison, not = [OK]

Hint: Use == or === for comparison, not = [OK]

Common Mistakes:

• Using = instead of == in conditions
• Starting loop from 1 instead of 2
• Returning true for numbers <= 1

5. You want to find the least common multiple (LCM) of two numbers using their greatest common divisor (GCD). Which formula correctly relates LCM and GCD for numbers a and b?

hard

A. LCM(a, b) = (a * b) / GCD(a, b)

B. LCM(a, b) = GCD(a, b) / (a * b)

C. LCM(a, b) = a + b - GCD(a, b)

D. LCM(a, b) = a - b + GCD(a, b)

Solution

1. Step 1: Recall the relationship between LCM and GCD

   The formula states that the product of two numbers equals the product of their GCD and LCM.

2. Step 2: Write the formula for LCM

   Rearranging gives LCM(a, b) = (a * b) / GCD(a, b). Options A, C, and D do not match this formula.

3. Final Answer:

   LCM(a, b) = (a * b) / GCD(a, b) -> Option A

4. Quick Check:

   LCM x GCD = a x b [OK]

Hint: Use LCM = (a x b) / GCD to find least common multiple [OK]

Common Mistakes:

• Confusing division order in formula
• Adding or subtracting instead of multiplying/dividing
• Forgetting to use GCD in formula