Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Hello, please help! I have all the instructions below. Please do not use Continue, break, and with any loops please do not use any boolean

Hello, please help! I have all the instructions below. Please do not use "Continue", "break", and with any loops please do not use any boolean statements. For example: while(true). Any other form is fine just not was I showed. Thank you!

!image text in transcribed

Write a program that reads student scores, gets the best score and then assigns grades based on the following scheme: Grade is A if score is best-10 Grade is B if score isbest- 20 Grade is C if the score is >= best-30 Grade is D if score>best-40 Grade is F otherwise Here are the steps that must be taken . Ask the user the number of the students 2. Declare an array with the given size . Store the grades in the array . Fine the maximum grade in the array 5. Output the result Here is the list of the methods: 1. illArray that fills the array with the students' grades. You must pass an array as the parameter 2. findMaxGrade, returns the max grade in the array. Gets the array of the grade as the parameter 3. output that displays the result. This method gets the max score and the array of scores as its parameter 4. main, in this method you ask the user if she/he wants to repeat using the program. Here is sample output: Enter the number of the students:4 Enter 4 scores: 40 55 70 58 Here is the result Student Score Grade 40 70 58

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Processing Fundamentals Design And Implementation

Authors: David M. Kroenke

5th Edition

B000CSIH5A, 978-0023668814

Students also viewed these Databases questions