Question

In: Computer Science

Write a method with the following header: public static void showGradeDistribution(int a, int b, int c,...

Write a method with the following header:

public static void showGradeDistribution(int a, int b, int c, int d,

int f)

It should print a graph (using asterisks) for each of the letters entered in the reverse order of the

parameter list and with a label. In addition, if A and B grades sum is equal or exceeds that of grades C

and D and F, the message “Strong class!” should be displayed. For example a method call of:

showGradeDistribution(5,7,4,4,3);

Would print:

A: *****

B: *******

C: ****

D: ****

F: ***

Strong class

Solutions

Expert Solution

Thanks for the question. Below is the code you will be needing. Let me know if you have any doubts or if you need anything to change. 

If you are satisfied with the solution, please leave a +ve feedback : ) Let me know for any help with any other questions.

Thank You!
===========================================================================

public static void showGradeDistribution(int a, int b, int c, int d, int f) {

    System.out.print("A: ");
    for (int star = 1; star <= a; star++) System.out.print("*");

    System.out.print("\nB: ");
    for (int star = 1; star <= b; star++) System.out.print("*");

    System.out.print("\nC: ");
    for (int star = 1; star <= c; star++) System.out.print("*");

    System.out.print("\nD: ");
    for (int star = 1; star <= d; star++) System.out.print("*");

    System.out.print("\nF: ");
    for (int star = 1; star <= f; star++) System.out.print("*");
    System.out.println();

    if((a+b)>=(c+d+f)){
        System.out.println("Strong class!");
    }

}

===================================================================

public class ExOne {

    public static void showGradeDistribution(int a, int b, int c, int d, int f) {

        System.out.print("A: ");
        for (int star = 1; star <= a; star++) System.out.print("*");

        System.out.print("\nB: ");
        for (int star = 1; star <= b; star++) System.out.print("*");

        System.out.print("\nC: ");
        for (int star = 1; star <= c; star++) System.out.print("*");

        System.out.print("\nD: ");
        for (int star = 1; star <= d; star++) System.out.print("*");

        System.out.print("\nF: ");
        for (int star = 1; star <= f; star++) System.out.print("*");
        System.out.println();

        if((a+b)>=(c+d+f)){
            System.out.println("Strong class!");
        }

    }

    public static void main(String[] args) {

        showGradeDistribution(5,7,4,4,3);
    }
}


Related Solutions

rite a method with the following header: public static void showGradeDistribution(int a, int b, int c,...
rite a method with the following header: public static void showGradeDistribution(int a, int b, int c, int d, int f) It should print a graph (using asterisks) for each of the letters entered in the reverse order of the parameter list and with a label. In addition, if A and B grades sum is equal or exceeds that of grades C and D and F, the message “Strong class!” should be displayed. For example a method call of: showGradeDistribution(5,7,4,4,3); Would...
JAVA Given the header of a method public static void m1 (int[ ] max) Write down...
JAVA Given the header of a method public static void m1 (int[ ] max) Write down Java codes to invoke m1 method, declare variables as needed, (Do NOT implement the method)
Write a method with the following header: public static char calculateLetterGrade(int grade, int totalMarks) This method...
Write a method with the following header: public static char calculateLetterGrade(int grade, int totalMarks) This method calculates grade/totalMarks and returns a letter grade based on the following scale: 0-50 = F 51-60 = D 61-70 = C 71-80 = B 81-100 = A
JAVA please write this method public static void recursiveSelectionSort(int[] arr) { }
JAVA please write this method public static void recursiveSelectionSort(int[] arr) { }
JAVA please write this method public static void recursiveMergeSort(int[] arr) { }
JAVA please write this method public static void recursiveMergeSort(int[] arr) { }
Given the following method declaration, write a valid method call. public static void calcArea(String roomName, int...
Given the following method declaration, write a valid method call. public static void calcArea(String roomName, int length, int width)
Write a method public static void minMax(int[] arr) that takes an array of unique ints of...
Write a method public static void minMax(int[] arr) that takes an array of unique ints of length at least two as an argument, and swaps the smallest value of the array into the 0th position and swaps the largest value of the array into the last position. For example, if int[] a = {4, 3, 2, 6, 1, 5}, the method call minMax(a) should modify the array so that it is {1, 3, 2, 5, 4, 6}. The method should...
in java. using the following template as a method, public static void shellSort(int[] array) { create...
in java. using the following template as a method, public static void shellSort(int[] array) { create a program that counts the number of comparisons and swaps of the sorting method does using int array1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; // Best Case Test int array2[] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1}; // Worst Case Test int array3[] = {10, 4, 8, 2, 6, 1, 9, 3, 7, 5}; //...
Re-write this method using iteration ONLY JAVA class Main { public static void merge(int arr[], int...
Re-write this method using iteration ONLY JAVA class Main { public static void merge(int arr[], int l, int m, int r) { int n1 = m - l + 1; int n2 = r-m; int left[] = new int[n1]; int right[] = new int[n2]; for (int i = 0; i < n1; ++i) left[i] = arr[l + i]; for (int j = 0; j < n2; ++j) right[j] = arr[m + 1 + j]; int i=0; //left int j=0; //...
public class Problem1 {    public static void partition(int[] A)    {        /*Rearrange the...
public class Problem1 {    public static void partition(int[] A)    {        /*Rearrange the array to have the following property:        Suppose the first element in the original array has the value x.        In the new array, suppose that x is in position i, that is data[i] = x.        Then, data[j] <= x for all j < I and data[j] > x for all j > i.        Thus, informally, all the...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT