Recursion

1. Determine what the following function calls return for recursive function func below. (4 pts.)

public static int func(int n)

{

if(n == 1)

return 2;

else

return 2 + func(n-1);

(a) func(1) = _________

(b) func(4) = _________

2. Does func above perform top down or bottom up computation? _________________ (2 pts.)

3. Determine the general result (in terms of n) of the following recursive function (4 pts.)

public static void func2(int n)

{

if(n == 1)

System.out.println(*);

else

{

for (int i = 1; i <= n; i++)

System.out.print(*);

System.out.println();

func2(n-1);

}

}

4. Does func2 above perform down or bottom up computation? ___________________ (2 pts.)