Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

C Program: Implement a sorted linked list for Students. A student has a name (string) and GPA (float). The node of the linked list will

C Program:

image text in transcribed

Implement a sorted linked list for Students. A student has a name (string) and GPA (float). The node of the linked list will contain a name, a GPA, and a pointer to the next node. Name GPA Next Create a menu where the user will choose the operation he/she wants to perform until 'x' is pressed. The menu is: Press 'e' to enter a new student to add into the linked list Press 'r' to remove a student from the list Press 'x' to exit Choosing the option 'e' will allow the user to give a string name (name might have space) and a float GPA input so that the program can add it to the linked list. The nodes should be inserted in GPA wise descending order. After adding the item, please display the current name and GPA in the ist like a comma separated tuples. The output should look like this "(name1, GPA1), (name2, GPA2),.. (name n, GPA n) Choosing the option r' will remove the student with lowest GPA. After deleting the item, display the linked list as discussed in the above option. Choosing the option 'X'will exit the program

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

Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2017 Skopje Macedonia September 18 22 2017 Proceedings Part 3 Lnai 10536

Authors: Yasemin Altun ,Kamalika Das ,Taneli Mielikainen ,Donato Malerba ,Jerzy Stefanowski ,Jesse Read ,Marinka Zitnik ,Michelangelo Ceci ,Saso Dzeroski

1st Edition

3319712721, 978-3319712727

More Books

Students also viewed these Databases questions