CSD203-Quiz5-Recursion

Recursion is defined as a process which calls itself directly or indirectly and the corresponding function is called a _________ function

When a function is called within itself directly it is called ______ recursion.

Types of direct recursion:

• • - Tail recursion

  • - Head recursion 

  • - Tree recursion

  • - Nested recursion

• • - Tail recursion

  • - Head recursion 

• • - Tail recursion

  • - Head recursion 

  • - Tree recursion

• • - Tail recursion

  • - Head recursion 

  • - Nested recursion

Indirect recursion occurs when a function calls another function that eventually calls the original ________ and it forms a cycle.

Recursion is used in many fields of computer science and mathematics, which includes:

• • - Searching and sorting algorithms

  • - Mathematical calculations

  • - Compiler design

  • - Graphics

  • - Artificial intelligence

• • - Searching and sorting algorithms

  • - Mathematical calculations

  • - Graphics

  • - Artificial intelligence

• • - Searching and sorting algorithms

  • - Mathematical calculations

  • - Compiler design

• • - Mathematical calculations

  • - Compiler design

  • - Graphics

  • - Artificial intelligence

Advantages of Recursion:

• A. Recursion can simplify complex problems by breaking them down into smaller, more manageable pieces.

• B. Recursive code can be more readable and easier to understand than iterative code.

• C. Recursion is essential for some algorithms and data structures.

• D. Reduce the length of code and become more readable and understandable.

• A.

  B.

  C.

  D

• A.

  B.

  C.

• A.

  B.

  D.

• A.

  C.

  D.

Disadvantages of Recursion:

A. Recursion can be less efficient than iterative solutions in terms of memory and performance.

B. Recursive functions can be more challenging to debug and understand than iterative solutions.

C. Recursion can lead to stack overflow errors if the recursion depth is too high.

• A.

  B.

  C.

• A.

  B.

• A.

  C.

• B.

  C.

Which of the correctly implements a recursive binary search?

Answer: The provided implementation__________.

• is correct

• is incorrect

• has an error

• generates infinite cycles

What is the time complexity of the recursive Fibonacci function without memoization?

• A

• B

• C

• D

Which of the following is a correct base case for a recursive function that calculates the factorial of a number?

• A

• B

• C

• D