Question
Book Icon
Chapter 30, Problem 30.1PE
Program Plan Intro

Assign grades

Program Plan:

  • Import necessary packages into program.
  • Define the class named “Exercise30_01”.
    • Define main method.
    • Define the “Scanner” object “obj” for input.
    • Prompt the user and get the number of students “N” from user.
    • Declare the array variable “marks[]” in type of “double”.
    • Prompt and get scores using “for” loop.
    • Using “DoubleStream” class assign maximum value into “best” variable.
    • Declare the “grade” in type of “character”.
    • Using “for” loop which is execute from “0” to “marks.length”.
      • Using “if..elseif..else” condition, check the score value.
        • If the value greater than “best-10”, assign “A” to “grade”.
        • If the value greater than “best-20”, assign “B” to “grade”.
        • If the value greater than “best-30”, assign “C” to “grade”.
        • If the value greater than “best-40”, assign “D” to “grade”.
        • Otherwise, assign “E” to “grade”.
        • Print appropriate grade with statement on screen.

Expert Solution & Answer
Check Mark
Program Description Answer

The following JAVA code is to calculate the grade of student scores using “DoubleStream”.

Explanation of Solution

Program:

/*Include necessary packages*/

import java.util.Scanner;

//Include Stream package

import java.util.stream.DoubleStream;

//Class definition

class Exercise30_01

{

//Main method

public static void main(String[] args)

{

/*Definition of "Scanner" object*/

Scanner obj = new Scanner(System.in);

/*Prompt the user for number of students*/

System.out.print("Enter number of students: ");

//Get input from user

int N = obj.nextInt();

/*Declaration and definition of array variable*/

double[] marks = new double[N];

//Prompt the user for marks

System.out.print("Enter " + N + " scores: ");

//Loop

for (int i = 0; i < marks.length; i++)

{

/*Get scores and store into "marks[]" variable*/

marks[i] = obj.nextDouble();

}

/*Get maximum value using stream*/

double best = DoubleStream.of(marks).max().getAsDouble();

//Declaration of variable

char grade;

//Loop

for (int i = 0; i < marks.length; i++)

{

/*Condition to check marks*/

if (marks[i] >= best - 10)

//Assign grade

grade = 'A';

/*Condition to check marks*/

else if (marks[i] >= best - 20)

//Assign grade

grade = 'B';

/*Condition to check marks*/

else if (marks[i] >= best - 30)

//Assign grade

grade = 'C';

/*Condition to check marks*/

else if (marks[i] >= best - 40)

//Assign grade

grade = 'D';

//Else statement

else

//Assign grade

grade = 'F';

//Print statement

System.out.println("Student " + i + " score is " +marks[i] + " and grade is " + grade);

}

}

}

Sample Output

Enter number of students: 4

Enter 4 scores: 40 55 70 58

Student 0 score is 40.0 and grade is C

Student 1 score is 55.0 and grade is B

Student 2 score is 70.0 and grade is A

Student 3 score is 58.0 and grade is B

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
solve this questions for me .
a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?
Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the

Chapter 30 Solutions

Instructor Solutions Manual For Introduction To Java Programming And Data Structures, Comprehensive Version, 11th Edition

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage