GATE IT 2008 | Question: 82

Question

Consider the code fragment written in C below :

void f (int n)
{ 
  if (n <=1)  {
   printf ("%d", n);
  }
  else {
   f (n/2);
   printf ("%d", n%2);
  }
}

What does f(173) print?

• A. $010110101$
• B. $010101101$
• C. $10110101$
• D. $10101101$

Comments

It can also be solved by drawing a stack and then popping the elements and printing them.

---

yes, A and B are rejected at a glance.

D is correct as it is the binary way of writing 173

Answer 1

Answer: D

The function prints the binary equivalent of the number $n$.

Binary equivalent of $173$ is $10101101$.

Answer 2

OUTPUT IS

10101101

i.e Option  D
since recusive funtion calls will be 

1st function call 173/2=86(int part only)

2nd function call 86/2 =43

3rd function call 43/2=21(int part only)

4th function call 21/2=10(int part only)

5th function call 10/2=5

6th function call 5/2=2(integer part only)

7th function call 2/2=1

now in 7th function call condition if(n<=1) will become true 
so  n will be printed( i.e 1 will be printed )

now while returning every function will execute its remaining part of code ie
 

 printf ("%d", n%2);

So 6th function will print 2 mod 2 =0

5th  function will print 5 mod 2=1

4th function will print 10 mod 2 =0

3rd function will print 21 mod 2 =1

2nd function will print 43 mod 2 =1

1st function will print 86 mod 2 =0

the main f function call will print 173 mod 2 =1

Answer 3

Here  before calling f(n/2) we need to push the printf statement into stack.

and we know stack follows LIFO order so Last in First print here.

Hence D is Ans.

Answer 4

above function is same as 

 

void f (int n) {

        if (n/2) {

        f(n/2);

       }

       printf ("%d", n%2);

}

and print the same output.

 

Answer : D