subject

Ask the user to input their grade percentage (e. g. the use will enter 98 if they had an overall grade of 98% in their course) for their Accounting, Marketing, Economics and MIS courses. Assume each course is worth 3 credit hours. Once you have all of their grades output what letter grade they earned for each course (e. g. Your letter grade for {Accounting/Marketing/whichever one you are outputting} is {A/B/C/D/F}). After you have output all of their letter grades, output their overall GPA for the semester using the formula: Letter Grade Point Value for Grade
A 4.00
B 3.00
C 2.00
D 1.00
F 0.00
Example Student Transcript
Course Credit Hours Grade Grade Points
Biology 5 A 20
Biology Lab 1 B 3
English 5 C 10
Mathematics 5 F 033
16 Total Credits Attempted 33 Total Grade Points
Total Points Earned/Total Credits Attempted = Grade Point Average
33 Points Earned/16 Credits Attempted = 2.06 GPA
For more details on how to calculate your GPA, go to http://academicanswers. waldenu. edu/faq/73219 e
GPA - Convert MIS grade to letter grade using a conditional statement
GPA - Convert Accounting letter grade to points earned (can be done in same conditional as letter grade
GPA - Convert Marketing letter grade to points earned (can be done in same conditional as letter grade)
GPA-Convert Economics letter grade to points earned (can be done in same conditional as letter grade)
GPA-Convert MIS letter grade to points earned (can be done in same conditional as letter grade) GPA - Calculate the GPA
GPA-Output the letter grade for each course
GPA-Output the overall GPA for the semester

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 05:20
Write a program called assignment3 (saved in a file assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b.c. it is a simple but very e↵ective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the “larger” integer is replaced by the di↵erence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.
Answers: 3
question
Computers and Technology, 23.06.2019 01:50
Create a class named majors that includes an enumeration for the six majors offered by a college as follows: acc, chem, cis, eng, his, phys. display the enumeration values for the user, then prompt the user to enter a major. display the college division in which the major falls. acc and cis are in the business division, chem and phys are in the science division, and eng and his are in the humanities division. save the file as majors.java.
Answers: 2
question
Computers and Technology, 23.06.2019 17:00
What does the faves button do? a. users mark a web page as a favorite b. leads other readers to favor a specific page c. readers sort and align their favicons, or favorite icons d. leads users to a message board where they can post questions
Answers: 1
question
Computers and Technology, 24.06.2019 02:20
Peter is thinking of a number which isless than 50. the number has 9 factors.when he adds 4 to the number, itbecomes a multiple of 5. what is thenumber he is thinking of ?
Answers: 1
You know the right answer?
Ask the user to input their grade percentage (e. g. the use will enter 98 if they had an overall gra...
Questions
question
Mathematics, 02.08.2019 21:30
question
History, 02.08.2019 21:30