subject
Computers and Technology, 25.06.2020 02:01 mimas76

Design and implement a program (name it GradeReport) that uses a switch statement to print out a message that reflect the student grade on a test. The messages are as follows: For a grade of 100 or higher, the message is ("That grade is a perfect score. Well done.")
For a grade 90 to 99, the message is ("That grade is well above average. Excellent work.")
For a grade 80 to 89, the message is ("That grade is above average. Nice job.")
For a grade 70 to 79, the message is ("That grade is average work.")
For a grade 60 to 69, the message is ("That grade is not good, you should seek help!")
For a grade below 60, the message is ("That grade is not passing.")

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 21.06.2019 21:00
Analyze the following code. int x = 1; while (0 < x) & & (x < 100) system.out.println(x++); a. the loop runs forever. b. the code does not compile because the loop body is not in the braces. c. the code does not compile because (0 < x) & & (x < 100) is not enclosed in a pair of parentheses. d. the numbers 1 to 99 are displayed. e. the numbers 2 to 100 are displayed.
Answers: 3
question
Computers and Technology, 21.06.2019 23:30
Show that there is a language a ⚆ {0, 1} â— with the following properties: 1. for all x â a, |x| ≤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you don’t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there aren’t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.
Answers: 3
question
Computers and Technology, 23.06.2019 09:30
Name the range function that would generate the following list of integers values: 0,1,2,3,4,5.
Answers: 1
question
Computers and Technology, 23.06.2019 18:30
The computers in the sales department did not have enough data storage capacity to contain all the information the department needed to store, and it was taking a long time for team members to access the data they needed. to fix the problem, the technician installed new, larger hard drives on all the computers.
Answers: 1
You know the right answer?
Design and implement a program (name it GradeReport) that uses a switch statement to print out a mes...
Questions
question
English, 30.07.2019 12:00
question
Mathematics, 30.07.2019 12:00