Question

In: Computer Science

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 print:

A: *****

B: *******

C: ****

D: ****

F: ***

Strong clas

Solutions

Expert Solution

public class GradeGraph {
        public static void main(String[] args) {
                showGradeDistribution(5, 7, 4, 4, 3); //supply values for grades
        }
//function that takes grades as parameters
        public static void showGradeDistribution(int a, int b, int c, int d, int f) //function that takes grades as parameters
        {
                System.out.print("A: "); //print asterisks for A grade
                for(int i = 0; i<a; i++) //loop until a
                {
                        System.out.print('*'); //print asterisk for number of times A is received
                }
                System.out.println();
                System.out.print("B: "); //print asterisks for B grade
                for(int i = 0; i<b; i++)
                {
                        System.out.print('*');
                }
                System.out.println();
                System.out.print("C: "); //print asterisks for C grade
                for(int i = 0; i<c; i++)
                {
                        System.out.print('*');
                }
                System.out.println();
                System.out.print("D: "); //print asterisks for D grade
                for(int i = 0; i<d; i++)
                {
                        System.out.print('*');
                }
                System.out.println();
                System.out.print("F: "); //print asterisks for F grade
                for(int i = 0; i<f; i++)
                {
                        System.out.print('*');
                }
                System.out.println();
                if((a+b)>=(c+d+f)) //as per question if sum of a and b is >= sum of c d and f
                {
                        System.out.println("Strong class!"); //print strong class
                }
        }
}

OUTPUT OF THE PROGRAM ON INPUT: showGradeDistribution(5,7,4,4,3);

OUTPUT OF THE PROGRAM ON INPUT: showGradeDistribution(2,7,4,4,3);

Notice here strong class is missing.

Thanks and please do not forget to leave a thuumbs up :)


Related Solutions

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...
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) { }
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}; //...
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)
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...
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...
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; //...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT