Skip to content

Quiz on Recursion in DSA

Quiz on Recursion in DSA

Time limit: 0

Quiz Summary

0 of 10 Questions completed

Questions:

Information

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 10 Questions answered correctly

Your time:

Time has elapsed

You have reached 0 of 0 point(s), (0)

Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)

Categories

Not categorized 0%

Review / Skip
Answered
Correct
Incorrect

Question 1 of 10

1. Question

What is recursion in programming?

A loop that runs forever
Correct Incorrect Correct answer

A function that calls itself
Correct Incorrect Correct answer

A way to reverse arrays
Correct Incorrect Correct answer

A method used only in sorting
Correct Incorrect Correct answer

Correct

Incorrect
Question 2 of 10

2. Question

Which condition is essential to stop a recursive function?

While loop
Correct Incorrect Correct answer

Return statement
Correct Incorrect Correct answer

Base condition
Correct Incorrect Correct answer

Print statement
Correct Incorrect Correct answer

Correct

Incorrect
Question 3 of 10

3. Question

What happens if a recursive function doesn’t have a base case?

It stops automatically
Correct Incorrect Correct answer

It runs once
Correct Incorrect Correct answer

It causes infinite recursion and may crash
Correct Incorrect Correct answer

It returns 0
Correct Incorrect Correct answer

Correct

Incorrect
Question 4 of 10

4. Question

Which of the following problems is best suited for recursion?

Multiplying two numbers
Correct Incorrect Correct answer

Checking if a number is even
Correct Incorrect Correct answer

Calculating factorial of a number
Correct Incorrect Correct answer

Swapping two variables
Correct Incorrect Correct answer

Correct

Incorrect
Question 5 of 10

5. Question

What is the base case in the recursive function for computing factorial?

n = 0 or n = 1
Correct Incorrect Correct answer

n = 2
Correct Incorrect Correct answer

n = -1
Correct Incorrect Correct answer

n = 10
Correct Incorrect Correct answer

Correct

Incorrect
Question 6 of 10

6. Question

Which of the following is an example of a recursive approach?

Iterating using for loop
Correct Incorrect Correct answer

Calling another function from main()
Correct Incorrect Correct answer

A function calling itself for a smaller input
Correct Incorrect Correct answer

Using a switch statement
Correct Incorrect Correct answer

Correct

Incorrect
Question 7 of 10

7. Question

What is the main drawback of recursion if not used carefully?

Reduces code readability
Correct Incorrect Correct answer

May lead to memory overflow
Correct Incorrect Correct answer

Increases code length
Correct Incorrect Correct answer

Makes output unpredictable
Correct Incorrect Correct answer

Correct

Incorrect
Question 8 of 10

8. Question

Which memory segment is used to store recursive function calls?

Heap
Correct Incorrect Correct answer

Code
Correct Incorrect Correct answer

Stack
Correct Incorrect Correct answer

Register
Correct Incorrect Correct answer

Correct

Incorrect
Question 9 of 10

9. Question

function test(n) {
if(n == 0) return;
test(n – 1);
}

1
Correct Incorrect Correct answer

2
Correct Incorrect Correct answer

3
Correct Incorrect Correct answer

4
Correct Incorrect Correct answer

Correct

Incorrect
Question 10 of 10

10. Question

Which of the following problems is commonly solved using recursion?

Bubble sort
Correct Incorrect Correct answer

Inserting into a stack
Correct Incorrect Correct answer

Fibonacci number generation
Correct Incorrect Correct answer

Deleting from an array
Correct Incorrect Correct answer

Correct

Incorrect

Fill the form to proceed
Upskill & get ready for AI-era

Please leave this field empty.

Δ

Our executives will contact you shortly

Have Questions?
Talk directly to the Instructor

Please leave this field empty.

Δ

Our executives will arrange a call with the Instructor shortly

talk to the instructor

Career Counselling

Please leave this field empty.

Δ

Login

Accessing this course requires a login. Please enter your credentials below!

Username or Email Address

Password

Remember Me

Signup / Login with Google

Signup / Login with X

Lost Your Password?

Register

Don't have an account? Register one!

Register an Account