GATE CSE 2015 Set 2 | Question: 15

Question

Consider the following function written in the C programming langauge :

void foo(char *a)
 {
    if (*a && *a != ' ')
      {
       foo(a+1);
       putchar(*a);
      }
}    

The output of the above function on input "$ABCD \ EFGH$" is

• A. $ABCD \ EFGH$
• B. $ABCD$
• C. $HGFE \ DCBA$
• D. $DCBA$

Comments

Since this is a recursion so characters are stored one by one on the stack and then printed right.?But if putchar(char *a) is placed before calling of the foo() then will the output be ABCD?

---

plzz explain someone

---

YES

---

https://www.youtube.com/watch?v=6A1fVJN7dQo

Answer 1

Answer D as priority of $!=$ is greater than that of $\&\&$ in C. The execution happens as:

if ((*a) && (*a != ' '))

So, the if breaks either when $*a = 0$ (not '$0$' but ASCII $0$ or null character '\0'), or when $*a =$' '.

So, the recursive call goes like

$\text{'A' - 'B' - 'C' - 'D' -' '}$ (breaks) and then starts outputting

$DCBA$

Comments

https://ideone.com/na0SgZ

if ((*a && *a) != ' ')

for this LHS is always 1 or 0 and ASCII of space is 32 so,

if condition is always true. So, infinite loop and at the end stack overflow runtime error. 

---

Input is just "ABCD EFGH". (No stackoverflow and infinite loop) Runtime error just becasue illegal access of memory at the end by *a. 

---

@ASNR1010 Why should there be Runtime error for illegal access?

The program doesn’t even call $foo(105)$ {taking base address of *a as 100 and char as 1B}.

It will successfully call till $foo(104)$ and end after popping out the remaining segments in the stack containing previous calls of $putchar(*a)$.

Answer 2

THIS MIGHT HELP

 

Answer 3

Change the answer to D.

Answer 4

as given in condition :  if *a = ' ' then it will not proceed further..hence we have to take only till ABCD ,

forget about EFGH.
aslo, it is tail recursion , means , your last called function's full body will execute first. Hence it will print DCBA.