Question

The language is C.

What is function(9)? Use a recursion tree to find the answer.

int function(int n) {

If (n<=1)

return 1;

If (n%2==0)

return f(n/2);

return f(n/2) + f((n/2)+1);

}

Answer #1

Ans --> On giving n=9 the first two conditions in if statements will be false so last statement will be executed which will give call to f(4)+f(5) and these two will be evaluated individually which i am providing with tree diagram.

In order to support my answer i have implemented the same function which i am providing you screenshot of code along with output.

In C can you change this code to use Tail Call Recursion
int min (int n, int[] input)
{
int i;
int result;
for (result = input[0], i = 0; i < n; i += 1)
{
if (result > input[i]) result = input[i];
}
return result;
}

QUESTION 1
For the following recursive function, find f(5):
int f(int n)
{
if (n == 0)
return 0;
else
return n * f(n - 1);
}
A.
120
B.
60
C.
1
D.
0
10 points
QUESTION 2
Which of the following statements could describe the general
(recursive) case of a recursive algorithm?
In the following recursive function, which line(s) represent the
general (recursive) case?
void PrintIt(int n ) // line 1
{ // line 2...

How would I write this function in C programming language?
Function header: int input(int *a, int *b, int
*c)
This function should attempt to input 3 integers from the
keyboard and store them in the memory locations pointed to by a, b,
and c. The input may not be successful in reading all three values.
The function should return the number of values that were
successfully read.

How would I write the following program in C programming
language?
Function header: int sumsort(int *a, int *b, int
*c)
This function should arrange the 3 values in the memory
locations pointed to by a, b, and c in ascending order and also
return the sum of the contents of the memory locations a, b, and
c.

Write a recursive method public static int
sumEveryOther(int n) that takes a positive int as an
argument and returns the sum of every other int from n down to
1.
For example, the call sumEveryOther(10) should return 30, since
10 + 8 + 6 + 4 + 2 = 30.
The call sumEveryOther(9) should return 25 since 9 + 7 + 5 + 3 +
1 = 25.
Your method must use recursion.

Given the following function:
int bar(int n) {
if( n < 0 )
return -2;
else if (n <= 1)
return 2;
else
return (3 + bar(n-1) +
bar(n-2));
}
What is returned by bar (4)? Show all the steps

FOR C PROGRAMMING LANGUAGE
Write a recursive C PROGRAMMING LANGUAGE function int
sumStrlens(const char* str1, const char* str2) which returns the
sum of strlen(str1) and strlen(str2). You can assume that
strlen(str2) is always strictly greater than strlen(str1)
(strlen(str2) > strlen(str1)). You MAY NOT use any function from
string.h. You MAY NOT use any square brackets([]) or any type of
loops in function.

What does the following function compute? Give an analysis of
its complexity
int fun1 (int n)
{
if (n == 0)
return
1;
else
return fun1(n-1) + fun1(n-1);
}

Find the sum of squares 1^2 + 2^2 + ... n^2 using iteration and
recursion
* I'm guessing we need to modify it
Here's the code unmodified
public class Sum {
//Non recursive sum
public static long sum1 (int n) {
long sum = 1L;
for (int i = 2; i <= n; ++i)
sum = sum + i *i ;
return sum;
}
//Recursive sum
public static long sum2 (int n) {
if (n < 2)return 1L;
return sum2(n...

Translate C code into MIPS. Do not include an exit syscall
int proc1( int a, int b ) {
if ( proc2( a, b ) >= 0 )
return 1;
else
return -1;
}
int proc2( int a, int b ) {
return (a*10) & (b*10);
}
int main() {
int a = 9;
int b = -10;
int c = a + b + proc1( a, b );
printf("%d\n", c );
return 0;
}

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 23 minutes ago

asked 48 minutes ago

asked 48 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 2 hours ago