CS270 Recitation 14: File I/O, Linked Lists

Goals

• Do some C file I/O
• Create a linked list
• Do some dynamic memory allocation/freeing

The Assignment

1. Make a subdirectory called R14 for the recitation; all files should reside in this subdirectory.
2. Copy data.txt to the R14 directory. It contains one line per student: Lastname,Firstname,GPA

   	    Smith,James,2.9
   	    Johnson,Mary,2.2

3. Write a program that:
   1. Declares struct Node, a node in a dynamically-allocated linked list. Each node will contain the information for a single student, plus a pointer to the next struct Node.
   2. Opens data.txt
   3. Reads & parses the lines, via fscanf, into nodes of the linked list. Insert the nodes into the linked list in increasing GPA order.
   4. Closes the data file.
   5. Locate the student whose last name is “Applin”, and delete him from the linked list.
   6. Traverses the linked list, displaying the information in increasing GPA order.
   7. Free all the memory that was dynamically allocated.

Notes

• Store the GPA as a float.
• Store the first & last names as char * pointers to dynamically-allocated strings via malloc and friends.
• You're not allowed to look at the file and hard-code the answers. This program must work no matter what information is in data.txt. For example, the sample data.txt has fifty lines, but you must not count on that in your program.
• You may assume that each line is, at most, 80 characters long.
• All dynamically-allocated memory must be freed at the end.
• Show your work to the TA to get credit.