DSA 02c Recursion Quiz

What is recursion?

• A way to increase memory usage

• A method to avoid loops in programming

• A technique to optimize code execution

• A programming technique where a function calls itself within its own definition

What is the base case in a recursive algorithm?

• A condition that stops the recursion

• A condition that starts the recursion

• A condition that changes the function signature

• A condition that increases the recursion depth

Which type of recursion involves a function calling itself directly?

• Unary Recursion

• Binary Recursion

• Indirect Recursion

• Tail Recursion

What is the Fibonacci sequence?

• A series of even numbers

• A series of numbers where each number is the sum of the two preceding ones

• A series of odd numbers

• A series of prime numbers

Which technique relies on recursion for tree and graph traversal?

• Depth-first search (DFS) and breadth-first search (BFS)

• Sorting algorithms

• Dynamic Programming

• Divide-and-Conquer

What is the Tower of Hanoi?

• A dynamic programming problem

• A sorting algorithm

• A graph traversal technique

• A classic puzzle that involves moving a stack of disks following specific rules

What is the purpose of the base case in recursion?

• To stop the recursion

• To add complexity to the problem

• To change the function signature

• To increase the recursion depth

Which type of recursion involves a function making two recursive calls?

• Direct Recursion

• Binary Recursion

• Head Recursion

• Unary Recursion

What is the factorial of a positive integer?

• The difference of all positive integers from 1 to the number

• The sum of all positive integers from 1 to the number

• The product of all positive integers from 1 to the number

• The division of all positive integers from 1 to the number

Which technique helps solve optimization problems by breaking them into smaller subproblems?

• Backtracking

• Greedy Algorithms

• Divide-and-Conquer

• Dynamic Programming