What is the output of the following C program?
#include <stdio.h>
int f(int *p, int n) {
if (n <= 1) return 0;
return *p + f(p + 1, n - 1);
}
int main(void) {
int a[] = {1, 2, 3, 4, 5};
printf("%d", f(a, 5));
return 0;
}f sums the first n-1 elements: a[0]+a[1]+a[2]+a[3] = 1+2+3+4 = 10.
What is the output of the following C function for call mystery(14)?
void mystery(int n) {
if (n > 0) {
mystery(n / 2);
printf("%d", n % 2);
}
}Prints binary representation of 14 in correct order: 14 = 1110_2.
Consider the following recursive C code:
int calc(int n) {
if (n <= 1) return 1;
if (n % 2 == 0) return calc(n / 2);
return calc(3 * n + 1);
}
What is calc(3)?Collatz sequence: calc(3)->calc(10)->calc(5)->calc(16)->calc(8)->calc(4)->calc(2)->calc(1) = 1.
Which type of recursion occurs when a function calls another function, which in turn calls the first function?
Indirect (or mutual) recursion involves two or more functions calling each other in a cycle.
What does the following recursive function return when called with s = "GATE"?
int len(char *s) {
if (*s == '\0') return 0;
return 1 + len(s + 1);
}Recursively computes string length of 'GATE', which is 4.