F2 - ALGO

What is recursion in the context of algorithms?

• A process where a function calls another function repeatedly

• A process where a function calls itself directly or indirectly

• A technique that avoids using functions entirely

• A method that exclusively uses loops to solve problems

Which of the following best describes the difference between iteration and recursion?

• Recursion consumes less memory than iteration

• Recursion is always faster than iteration

• Iteration uses repetition structures while recursion uses selection structures

• Iteration uses the stack while recursion does not

What is the primary reason for defining a base case in a recursive function?

• To reduce memory usage

• To increase execution speed

• To allow multiple functions to be called simultaneously

• To avoid infinite loops

In the context of recursion, what is tail recursion?

• When the recursive call happens at the beginning of the function

• When the recursive call is the last operation performed in the function

• When there are multiple recursive calls within the same function

• When the function calls another function instead of itself

What is the output of the following recursive function when n=3? int fun(int n){ if(n==1) return 1;else return 1 + fun(n-1);}

• 1

• 3

• 4

• 2

What is the time complexity of an algorithm that checks each triple in an array of size N?

• O(N)

• O(log N)

• O(N log N)

• O(N³)

Which asymptotic notation represents the worst-case scenario of an algorithm's running time?

• Θ (Theta)

• Ω (Omega)

• β (Beta)

• O (Big Oh)

What is space complexity in the context of algorithm analysis?

• The time it takes to compile an algorithm

• The number of CPU cycles needed to execute an algorithm

• The number of lines of code in an algorithm

• The amount of memory required by an algorithm to run

If an algorithm has a space complexity of O(1), what does this indicate?

• The space required depends on the number of recursive calls

• The space required grows exponentially with input size

• The space required is constant regardless of input size

• The space required grows linearly with input size

What is the time complexity of binary search in a sorted array of size N?

• O(N)

• O(N²)

• O(log N)

• O(N log N)