Skip to content

Quiz on Recursion in C

Quiz on Recursion in C

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 C?

A way to define macros
Correct Incorrect Correct answer

A function calling itself
Correct Incorrect Correct answer

Looping using while
Correct Incorrect Correct answer

A pointer to a function
Correct Incorrect Correct answer

Correct

Incorrect
Question 2 of 10

2. Question

Which keyword is used to define a recursive function in C?

recursive
Correct Incorrect Correct answer

return
Correct Incorrect Correct answer

loop
Correct Incorrect Correct answer

No special keyword is required
Correct Incorrect Correct answer

Correct

Incorrect
Question 3 of 10

3. Question

What is required to prevent a recursive function from running forever?

A loop
Correct Incorrect Correct answer

A break statement
Correct Incorrect Correct answer

A base condition
Correct Incorrect Correct answer

A global variable
Correct Incorrect Correct answer

Correct

Incorrect
Question 4 of 10

4. Question

int fun(int n) {
if(n == 0)
return 1;
else
return n * fun(n – 1);
}

int main() {
printf(“%d”, fun(3));
return 0;
}

6
Correct Incorrect Correct answer

9
Correct Incorrect Correct answer

3
Correct Incorrect Correct answer

1
Correct Incorrect Correct answer

Correct

Incorrect
Question 5 of 10

5. Question

What is a base condition in recursion?

The smallest input value
Correct Incorrect Correct answer

The condition where the function stops calling itself
Correct Incorrect Correct answer

The starting value of the function
Correct Incorrect Correct answer

The return value of the function
Correct Incorrect Correct answer

Correct

Incorrect
Question 6 of 10

6. Question

What happens if there is no base condition in a recursive function?

It returns 0
Correct Incorrect Correct answer

It runs only once
Correct Incorrect Correct answer

It causes an infinite loop or stack overflow
Correct Incorrect Correct answer

It gives a compile-time error
Correct Incorrect Correct answer

Correct

Incorrect
Question 7 of 10

7. Question

Which of the following problems can be solved using recursion?

Calculating factorial
Correct Incorrect Correct answer

Finding Fibonacci numbers
Correct Incorrect Correct answer

Solving a maze
Correct Incorrect Correct answer

All of the above
Correct Incorrect Correct answer

Correct

Incorrect
Question 8 of 10

8. Question

What is the main drawback of recursion?

It makes code shorter
Correct Incorrect Correct answer

It uses less memory
Correct Incorrect Correct answer

It can cause stack overflow if not handled properly
Correct Incorrect Correct answer

It cannot be used in real problems
Correct Incorrect Correct answer

Correct

Incorrect
Question 9 of 10

9. Question

Which memory segment is used to store recursive function calls?

Heap
Correct Incorrect Correct answer

Data segment
Correct Incorrect Correct answer

Stack
Correct Incorrect Correct answer

Queue
Correct Incorrect Correct answer

Correct

Incorrect
Question 10 of 10

10. Question

How does recursion differ from a loop?

Recursion cannot repeat
Correct Incorrect Correct answer

Recursion uses function calls, loops use iteration
Correct Incorrect Correct answer

Recursion runs faster than loops
Correct Incorrect Correct answer

Recursion is used only for string operations
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