Consider the same 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)?
a)
9
b)
8
c)
5
d)
2
Correct answer is option 'D'. Can you explain this answer?

Question

Consider the same 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)?

a)
9
b)
8
c)
5
d)
2

Correct answer is option 'D'. Can you explain this answer?

Answer

The given recursive C function seems to be incomplete, as the condition in the if statement is missing. However, based on the provided code, I can make some assumptions and provide a possible implementation.

Assuming that the missing condition in the if statement is 'n > 0', the function could be implemented as follows:

```c
unsigned int foo(unsigned int n, unsigned int r) {
if (n > 0) {
return foo(n - 1, r) + 2 * r;
}
return 0;
}
```

This function takes two unsigned int arguments, `n` and `r`, and recursively calculates the sum of `r` added to itself `n` times.

Here's a step-by-step explanation of how the function works:

1. The function checks if `n` is greater than 0. If it's true, the function proceeds with the recursive call; otherwise, it returns 0.
2. In the recursive call, the function decrements `n` by 1 and adds `2 * r` to the result of the recursive call with the updated `n`.
3. The recursion continues until `n` reaches 0, at which point the function returns 0.
4. As the recursive calls unwind, the function adds `2 * r` to the result of each recursive call, effectively summing `r` `n` times.

Here's an example usage of the `foo` function:

```c
unsigned int result = foo(3, 5);
printf('%u ', result); // Output: 30
```

In this example, the function `foo(3, 5)` is called. It calculates the sum of 5 added to itself 3 times, resulting in a sum of 30.

Similar Computer Science Engineering (CSE) Doubts

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) ?

Consider the following recursive C function that takes two argumentsunsigned int foo(unsigned int n, unsigned int r){if(n >0) return (n%r + foo (n/r, r));else return 0;}Q.What is the return value of the function foo when it is called as foo(345, 10) ?

The time complexity of the following C function is (assume n > 0int recursive (int n){if(n == 1)return (1);elsereturn (recursive (n-1) + recursive (n-1));}

The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}

The time complexity of the following C function is, (assume n> 0)int recursive (int n ){ if ( n = = 1)return (1);elsereturn (recursive ( n - 1) + recursive ( n - 1));}

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

Top Courses for Computer Science Engineering (CSE)

Suggested Free Tests

Related Content

Mock Test Series

Subject-wise Courses

Subject-wise Courses

Other Engg Branches

Company