KUC DSA 02c Recursion Quiz

What is recursion?

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

• A technique to optimize code execution speed

• A method to avoid using loops in programming

• A way to increase memory usage in programs

What is the base case in a recursive algorithm?

• A condition that slows down the recursion

• A condition that stops the recursion

• A condition that increases the recursion depth

• A condition that changes the recursion direction

Which type of recursion involves a function calling itself directly?

• Unary Recursion

• Binary Recursion

• Indirect Recursion

• Tail Recursion

What is the Fibonacci sequence?

• A sequence of even numbers

• A sequence of prime numbers

• A sequence of odd numbers

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

What is the Tower of Hanoi puzzle about?

• Moving a stack of disks from one peg to another following specific rules

• Optimizing code execution speed

• Solving mathematical equations recursively

• Creating a sequence of numbers

What is the purpose of a recursive case in a recursive algorithm?

• Stops the recursion

• Slows down the recursion

• Involves a call to the function itself with a smaller version of the problem

• Increases the recursion depth

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

• Head Recursion

• Direct Recursion

• Unary Recursion

• Binary Recursion

What is the factorial of a positive integer?

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

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

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

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

What is the magic of recursion?

• Its ability to slow down code execution

• Its ability to increase memory usage

• Its ability to avoid using loops

• Its ability to create a stack of function calls

What technique relies on recursion for tree and graph traversal?

• Tower of Hanoi

• Divide-and-Conquer

• Dynamic Programming

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