GATE CS 2015 Set 2 — Question 21
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33MediumFunctions & RecursionC ProgrammingProgramming & Data StructuresPointers & Pointer ArithmeticArrays & Strings in C
Programming & Data Structures → C Programming → Arrays & Strings in C
Last updated
Question
Consider the following function written in the C programming language.The output of the above function on input "ABCD EFGH" is
void foo(char *a){
if ( *a && *a != ' '){
foo(a+1);
putchar(*a);
}
}
Correct answer
(D) DCBA
Solution
The function
foo is a recursive function that processes a string character by character. 1.The base case for the recursion is when
*a is either the null terminator \0 (evaluated as false in C) or a space character ' '.2.For the input "ABCD EFGH", the function calls itself recursively for 'A', then 'B', then 'C', then 'D'.
3.When the pointer reaches the space character between 'D' and 'E', the condition
*a != ' ' fails, and the recursion stops.4.Because
putchar(*a) is called after the recursive call foo(a+1), the characters are printed in reverse order as the recursion unwinds.5.The stack of calls returns in the order:
foo for 'D', then 'C', then 'B', then 'A'.6.The output is "DCBA".
Continue learning with Success Tracker
A step still unclear? Work through it with support
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.
More questions on C Programming
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 1 Q24Consider a hash table that is initially empty. The hash table is maintained…2026 Set 1 Q27Consider the following C statements: Which of the following options is/are correct? [figure]