Why Math and Number Theory Appear in DSA Problems in DSA Python - Challenge Your Understanding

Challenge - 5 Problems

❓ Predict Output

intermediate

Output of Euclidean Algorithm for GCD

What is the output of this code that finds the greatest common divisor (GCD) of 48 and 18 using the Euclidean algorithm?

DSA Python

def gcd(a, b):
    while b != 0:
        a, b = b, a % b
    return a

print(gcd(48, 18))

A 3

B 6

C 12

D 18

💡 Hint

Remember the Euclidean algorithm repeatedly replaces the larger number by the remainder until zero.

The Euclidean algorithm finds the GCD by repeatedly taking remainders. gcd(48,18) = gcd(18,12) = gcd(12,6) = gcd(6,0) = 6.

❓ Predict Output

intermediate

Output of Prime Check Function

What is the output of this code that checks if 29 is a prime number?

DSA Python

def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

print(is_prime(29))

A False

B None

C True

D Error

💡 Hint

A prime number has no divisors other than 1 and itself.

29 is a prime number because it has no divisors other than 1 and 29.

🧠 Conceptual

advanced

Why Modular Arithmetic is Used in DSA

Why do many algorithms in data structures and algorithms use modular arithmetic (like modulo operations) when dealing with large numbers?

A To keep numbers within a fixed range and avoid overflow in calculations

B To make numbers larger and more complex for security

C To sort numbers faster in arrays

D To convert numbers into strings for easier processing

💡 Hint

Think about what happens when numbers get very big in computers.

Modular arithmetic keeps numbers within a fixed range, preventing overflow and making calculations manageable.

❓ Predict Output

advanced

Output of Fibonacci with Modulo

What is the output of this code that calculates the 10th Fibonacci number modulo 100?

DSA Python

def fib_mod(n, m):
    a, b = 0, 1
    for _ in range(n):
        a, b = b, (a + b) % m
    return a

print(fib_mod(10, 100))

A 10

B 89

C 34

D 55

💡 Hint

Calculate Fibonacci numbers step by step and apply modulo 100 each time.

The 10th Fibonacci number is 55, and 55 % 100 is 55.

🧠 Conceptual

expert

Role of Number Theory in Cryptography Algorithms

Which of the following best explains why number theory is crucial in cryptography algorithms used in data security?

A Because prime numbers and modular arithmetic create hard problems that protect data

B Because number theory helps compress data for faster transmission

C Because number theory sorts data efficiently in databases

D Because number theory converts data into images for encryption

💡 Hint

Think about what makes encryption hard to break.

Cryptography relies on hard problems like factoring large primes and modular exponentiation, which come from number theory.