GATE CSE C Programming Practice Test – Recursion

Question 71

MSQ · Multiple Correct 2 mark

Which of the following statements regarding recursion in C are CORRECT?

A Every recursive function requires a base case to terminate. B Recursive calls consume stack memory for each invocation frame. C Static local variables inside recursive functions share a single memory location across all recursive calls. D Tail recursion always consumes more stack memory than non-tail recursion.

Question 72

MSQ · Multiple Correct 2 mark

Which of the following problems can be solved naturally using recursive divide-and-conquer strategy?

A Merge Sort B Quick Sort C Binary Search D Linear Search

Question 73

MSQ · Multiple Correct 2 mark

Which of the following can lead to stack overflow in recursive C programs?

A Absence of a proper base case B Deep recursion exceeding maximum stack memory allocation C Passing large arrays by value (if wrapped in structs) D Using static variables

Question 74

MSQ · Multiple Correct 2 mark

Which of the following statements about Tail Recursion are TRUE?

A The recursive call is the last executed statement in the function. B No operations are pending after the recursive call returns. C Tail recursive functions can be easily transformed into iterative loops. D Tail recursion requires double the stack space of linear recursion.

Question 75

MSQ · Multiple Correct 2 mark

Which of the following parameters/variables retain their values across recursive function calls in C?

A Global variables B Static local variables C Heap dynamically allocated memory pointers D Automatic local variables

GATE CSE C Programming Practice Test – Recursion | Set 1

Question 71

Detailed Solution

Question 72

Detailed Solution

Question 73

Detailed Solution

Question 74

Detailed Solution

Question 75

Detailed Solution