Write a complete Java program with comments in main and in each method. Create your own names for variables, methods and parameters. Design a Java dass that reads in a series of records from a file and Sample input .Your program must work for all values, not just for this sample!: xm1 92 78 84 95 99 xm2 98 85 83 81 79 midterm 88 83 75 88 83 processes them as follows: final 89 81 77 81 89 main will invoke a method to read the input data. The method will • read a record containing the name of an exam and five grades (don't store all 5!) • compute the lowest grade store the name in an array store the lowest grade in a parallel array. Repeat this until all records have been read in. There will be no more than 80 records. Finally, the method will return to main the number of records read. main will invoke a method to do two things. It will add 5 pts to the grade for any exam that is not named "final". It will count how many grades in the array are greater than the next element in the array and return the count back to main for main to print. Remember to print the count in main. main will invoke a method to sort the numeric array in descending order (highest to lowest), synching (dragging along) the array of names, or making sure the values in the name array still correspond correctly to the numbers. NOTE: You do NOT have to write the sorting method. DO write the call from the main as needed, and the HEADER for the method instead of the entire method. name min Finally, main will print to a chart in a file the sorted arrays (using a printf statement: left justified for the name of the exam, 2 decimal places for the grade). Put a heading on the chart. xm2 xm1 midterm final 84.00 83.00 80.00 77.00
Write a complete Java program with comments in main and in each method. Create your own names for variables, methods and parameters. Design a Java dass that reads in a series of records from a file and Sample input .Your program must work for all values, not just for this sample!: xm1 92 78 84 95 99 xm2 98 85 83 81 79 midterm 88 83 75 88 83 processes them as follows: final 89 81 77 81 89 main will invoke a method to read the input data. The method will • read a record containing the name of an exam and five grades (don't store all 5!) • compute the lowest grade store the name in an array store the lowest grade in a parallel array. Repeat this until all records have been read in. There will be no more than 80 records. Finally, the method will return to main the number of records read. main will invoke a method to do two things. It will add 5 pts to the grade for any exam that is not named "final". It will count how many grades in the array are greater than the next element in the array and return the count back to main for main to print. Remember to print the count in main. main will invoke a method to sort the numeric array in descending order (highest to lowest), synching (dragging along) the array of names, or making sure the values in the name array still correspond correctly to the numbers. NOTE: You do NOT have to write the sorting method. DO write the call from the main as needed, and the HEADER for the method instead of the entire method. name min Finally, main will print to a chart in a file the sorted arrays (using a printf statement: left justified for the name of the exam, 2 decimal places for the grade). Put a heading on the chart. xm2 xm1 midterm final 84.00 83.00 80.00 77.00
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Write a complete Java program with comments in main and in each method.
Create your own names for variables, methods and parameters.
Design a Java dlass that reads in a
series of records from a file and
processes them as follows:
Sample input .Your program must work
for all values, not just for this
sample!:
xm1 92 78 84 95 99
xm2 98 85 83 81 79
midterm 88 83 75 88 83
final 89 81 77 81 89
main will invoke a method to read the input data. The method will
read a record containing the name of an exam and five grades
(don't store all 5!)
compute the lowest grade
• store the name in an array
store the lowest grade in a parallel array.
Repeat this until all records have been read in. There will be no more
than 80 records.
Finally, the method will return to main the number of records read.
• main will invoke a method to do two things.
It will add 5 pts to the grade for any exam that is not named "final".
It will count how many grades in the array are greater than the next element in
the array and return the count back to main for main to print. Remember to
print the count in main.
main will invoke a method to sort the numeric array in
descending order (highest to lowest), synching (dragging
along) the array of names, or making sure the values in the
name array still correspond correctly to the numbers.
NOTE: You do NOT have to write the sorting method. DO
write the call from the main as needed, and the HEADER for
the method instead of the entire method.
min
84.00
name
• Finally, main will print to a chart in a file the
sorted arrays (using a printf statement: left
justified for the name of the exam, 2 decimal
places for the grade). Put a heading on the
chart.
xm2
xm1
83.00
midterm
80.00
final
77.00
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 3 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY