Write a recursive method called printlettersforward that


Write a recursive method called printLettersForward that will accept a character parameter. The method should print all of the letters of the alphabet up to (including) the parameter value. For example, if the parameter passed to the method is 'f', the method should print:

abcdef

The sequence of characters printed should be the same case as the parameter. If the parameter value is 'D' (uppercase), then the method should print:

ABCD

If the parameter value is not a letter of the alphabet, do not print anything. Do not return anything.

public static void printLettersForward(char c) { }

2. Copy the printLettersForward method and rename it printLettersBackwards. Change the method so that it prints the letters in reverse order. . If the parameter value is 'D' (uppercase), then the method should print:

DCBA

3. Write a recursive method called triangle that will display a triangle made of asterisks. The only parameter is an integer that determines the number of asterisks to print on the current line. Do not return anything. For example, if the test call to this method is triangle(5), the output should look like:

*

**

***

****

*****

public static void triangle(int n) { }

. 4. Copy the triangle method and rename it upsideDownTriangle. Change the method so that the longest line of asterisks prints first. If the parameter value is 5, the method should print:

*****

****

***

**

*

5. Write a method called powerOfTen that will find and return 10n for any integer n (n is the parameter). The method should return a double value.

Examples:

powerOfTen(3) should return 1000.0

powerOfTen(-3) should return 0.001

The method should not print anything.

public static double powerOfTen(int n) { }

Part B: Create a main method within the same program. Do not create a separate test program. Put a main method in Lab9.java. Add calls to the main to test each method as many times as needed to insure that all cases are working correctly.

This is a study worksheet for my upcoming exam, and Im not very good at recusive methods, and was wondering if anyone could show me how to do it. If you can I would be grateful, thank you in advanced to anyone who helps me.

Solution Preview :

Prepared by a verified Expert
Business Management: Write a recursive method called printlettersforward that
Reference No:- TGS02237085

Now Priced at $30 (50% Discount)

Recommended (93%)

Rated (4.5/5)