Recursion

Consider the following two functions.

void fun1(int n) {                void fun2(int n) {
        if(n == 0) return;                if(n == 0) return;
        printf("%d", n);                  printf("%d", n);
        fun2(n - 2);                      fun1(++n);
        printf("%d", n);                  printf("%d", n);
}                                   }

The output printed when fun1(5) is called is

Consider the C functions foo and bar given below:

int foo(int val) {
    int x = 0;
    while(val > 0) {
        x = x + foo(val--);
    }
    return val;
}

int bar(int val) {
    int x = 0;
    while(val > 0) {
        x = x + bar(val-1);
    }
    return val;
}

Invocations of foo(3) and bar(3) will result in:

Common Data for Questions 48 and 49: Consider the following recursive C function that takes two arguments.

unsigned int foo(unsigned int n, unsigned int r) {
    if (n>0) return ((n%r) + foo(n/r, r));
    else return 0;
}

What is the return value of the function foo when it is called as foo(345, 10)?

Common Data for Questions 48 and 49: Consider the following recursive C function that takes two arguments.

unsigned int foo(unsigned int n, unsigned int r) {
    if (n>0) return ((n%r) + foo(n/r, r));
    else return 0;
}

What is the return value of the function foo when it is called as foo(513, 2)?