Consider the C function given below. int f(int j) static int i = 50; int k; if (i == j) printf("something"); k = f(i); return 0; else return 0; Which one of the following is TRUE? A) The function returns 0 for all values of j. B) The function prints the string something for all values of j. C) The function returns 0 when j = 50. D) The function will exhaust the runtime stack or run into an infinite loop when j = 50.

Official answer: D) The function will exhaust the runtime stack or run into an infinite loop when j = 50.. Explanation: Let us trace the execution of the function `f(int j)`: 1. Inside `f`, the variable `i` is declared as `static int i = 50;`. This means `i` is initialized once to 50 and retains its value across all calls. 2. When `f(50)` is called (i.e., j = 50): - The condition `if (i == j)` evaluates to `if (50 == 50)`, which is true. - It prints `"something"`. - Then it executes `k = f(i);`, which is another recursive call `f(50)`. 3. In this recursive call, since `i` is still 50 and j is 50, the condition `i == j` is satisfied again, causing another recursive call `f(50)`. 4. There is no base condition to terminate this recursion when j = 50. This leads to infinite recursion, which will eventually exhaust the runtime call stack (stack overflow). Therefore, when j = 50, the function will exhaust the runtime stack or run into an infinite loop, making (D) the correct statement.

A) The function returns 0 for all values of j.

B) The function prints the string something for all values of j.

C) The function returns 0 when j = 50.

D) The function will exhaust the runtime stack or run into an infinite loop when j = 50.

Programming and Data Structures · Recursion

Official IIT answer key · IIT Kharagpur · Audited Aug 2026

Take topic test

GATE CSE 2014 Set 2 Q42 · MCQ · 2 marks

Consider the C function given below. `int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; }` Which one of the following is TRUE?

Select an option to check

Key concept

Recursion

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Recursion

GATE tests Recursion primarily through direct execution tracing of recursive C code snippets, stack-unwinding behavior (pre-order vs. post-order execution), and termination/infinite recursion analysis. Questions frequently incorporate static variables, pointer/reference aliasing, mutual recursion, and tree/array traversals to test whether candidates can systematically maintain call frames. In recent years, the focus has expanded from standard tracing to higher-order mathematical characterizations (e.g., finding the smallest input or maximum output value of composed recurrences).

Full Recursion guide →

More on Recursion

All 19 questions on Recursion →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Programming and Data Structures · Recursion

Official IIT answer key · IIT Kharagpur · Audited Aug 2026

Take topic test

GATE CSE 2014 Set 2 Q42 · MCQ · 2 marks

Consider the C function given below. `int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; }` Which one of the following is TRUE?

Select an option to check

Key concept

Recursion

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Recursion

Full Recursion guide →

More on Recursion

All 19 questions on Recursion →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Consider the C function given below. `int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; }` Which one of the following is TRUE?

Step-by-step verified solution

Check you can still solve Recursion under a clock

More from GATE CSE 2014 Set 2

More on Recursion

Consider the C function given below. `int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; }` Which one of the following is TRUE?

Step-by-step verified solution

Check you can still solve Recursion under a clock

More from GATE CSE 2014 Set 2

More on Recursion

Consider the C function given below. int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; } Which one of the following is TRUE?

Step-by-step verified solution

Check you can still solve Recursion under a clock

More from GATE CSE 2014 Set 2

More on Recursion

Share this solution

Consider the C function given below. int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; } Which one of the following is TRUE?

Step-by-step verified solution

Check you can still solve Recursion under a clock

More from GATE CSE 2014 Set 2

More on Recursion

Share this solution

Consider the C function given below. `int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; }` Which one of the following is TRUE?

Consider the C function given below. `int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; }` Which one of the following is TRUE?