GATE CS 2014 Set 2 — Question 52

MCQ+2 / -0.67MediumFunctions & RecursionC ProgrammingProgramming & Data StructuresStorage Classes

Programming & Data Structures → C Programming → Functions & Recursion

Last updated 5 September 2026

Question

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?

Correct answer (D) The function will exhaust the runtime stack or run into an infinite loop when j = 50. Solution The variable i is declared as static int i = 50;, so it is initialized only once and retains its value across function calls. When f(50) is called (j = 50): 1. The condition if (i == j) (i.e., 50 == 50) is true. 2. It prints "something". 3. It calls k = f(i), which is f(50) . Inside the recursive call f(50) : 1. i is still 50 (static). 2. j is 50 (passed argument). 3. The condition if (i == j) is true again. 4. It calls f(50) again. This leads to infinite recursion, which will eventually exhaust the runtime stack (Stack Overflow). Turn this into a strength. Explore AI-powered practice and doubt support with Success Tracker.

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

Correct answer (D) The function will exhaust the runtime stack or run into an infinite loop when j = 50. Solution The variable i is declared as static int i = 50;, so it is initialized only once and retains its value across function calls. When f(50) is called (j = 50): 1. The condition if (i == j) (i.e., 50 == 50) is true. 2. It prints "something". 3. It calls k = f(i), which is f(50) . Inside the recursive call f(50) : 1. i is still 50 (static). 2. j is 50 (passed argument). 3. The condition if (i == j) is true again. 4. It calls f(50) again. This leads to infinite recursion, which will eventually exhaust the runtime stack (Stack Overflow).

Continue learning with Success Tracker

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.