Question

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

Answer 1

3)

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

                     }

              }

For the above program it prints '*' in either case. So the output depends on 'n' value. It prints n '*'.

4)The above funcu2 is bottom up computation.