You are given the students.txt file which includes ids, names, and two grades (Math and Data Structures respectively). Read the content from this file and construct a linked list in reading order. I expect you to have a student class and keep the objects of that class in the linked list. After constructing the list have a menu to do the following using your linked list; Display the linked list content. Display the students sorted by their overall average. For this problem, use compareTo method of Student class you have written. Display the student names sorted by their data structure grades. Find and display the math average. Find and display the student(s) who has the lowest Data Structures grade. Delete the student whose id is entered by the user. insert a new student to the list by getting the info from the user. Find and display the student count. Students pass the class if their grade is above the average for each course. Find and display the successful students for each course.

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...
icon
Related questions
Question
Java , Data structures
You are given the students.txt file which includes ids, names, and two grades (Math and Data
Structures respectively). Read the content from this file and construct a linked list in reading
order. I expect you to have a student class and keep the objects of that class in the linked list.
After constructing the list have a menu to do the following using your linked list;
Display the linked list content.
Display the students sorted by their overall average. For this problem, use compareTo
method of Student class you have written.
Display the student names sorted by their data structure grades.
Find and display the math average.
Find and display the student(s) who has the lowest Data Structures grade.
Delete the student whose id is entered by the user.
insert a new student to the list by getting the info from the user.
Find and display the student count.
Students pass the class if their grade is above the average for each course. Find and
display the successful students for each course.
Transcribed Image Text:You are given the students.txt file which includes ids, names, and two grades (Math and Data Structures respectively). Read the content from this file and construct a linked list in reading order. I expect you to have a student class and keep the objects of that class in the linked list. After constructing the list have a menu to do the following using your linked list; Display the linked list content. Display the students sorted by their overall average. For this problem, use compareTo method of Student class you have written. Display the student names sorted by their data structure grades. Find and display the math average. Find and display the student(s) who has the lowest Data Structures grade. Delete the student whose id is entered by the user. insert a new student to the list by getting the info from the user. Find and display the student count. Students pass the class if their grade is above the average for each course. Find and display the successful students for each course.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 7 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY