Overview

In programming assignment 2 the issues of proper memory management for the Student and SortedList classes were ignored. The compiler defaults for the destructors, copy constructors, and copy assignment operators were assumed to be good enough. For this assignment you'll write your own to ensure that memory dynamically allocated in the classes is correctly managed.

Goals

The goals of this assignment are to gain experience:

• Writing a non-trivial destructor, copy constructor, and copy assignment operator.
• Writing and using private auxiliary functions.

Specifications

Updating the Student Class

Add the following to the Student class you wrote for Programming Assignment 2:

• a destructor,
• a copy constructor, and
• a copy assignment operator (operator= that defines the assignment operator for two Student objects)

Make sure to modify both Student.h and Student.cpp.

Updating the SortedList class

Add the following to the SortedList class you wrote for Programming Assignment 2:

• a destructor,
• a copy constructor, and
• a copy assignment operator (operator= that defines the assignment operator for two SortedList objects)

Make sure to modify both SortedList.h and SortedList.cpp.

SortedList Class Auxiliary Functions

Both the destructor and copy assignment operator of the SortedList class must deallocate the nodes of a linked list returning them to the free storage (i.e., the heap). Both the copy constructor and copy assignment operator make a deep copy of an existing linked list. Therefore, we expect you to write two auxiliary (helper) functions to handle these two tasks.

private:
    void      freeList (ListNode* L);
    ListNode* copyList (ListNode* L);

Implement an auxilliary function, named freeList, having one parameter, a pointer to a ListNode. This function traverses the linked list, returning each node to free storage. We expect it to be used by both the destructor and copy assignment operator.

Also implement an auxilliary function, named copyList, having one parameter, a pointer to a ListNode. This function returns a pointer to the first node of a copy of original linked list. We expect it to be used by both the copy constructor and the copy assignment operator.

Note both auxilliary functions are implemented as private and intended to only be used within the class.

You can assume that your program will be tested on a main.cpp function that is similar to this one. We are not providing sample output in order to give you practice in reading the code and determining what you think the proper output should be.

Submitting Your Work

Make sure your code follows the style and commenting standards used in CS 302 and CS 367. Note: the commenting standards use javadoc comments for class, method, and constructor headers. You do not need to use javadoc comments in your c++ programs for CS 368; however, your comments should include the same information as the javadoc comments. For example, your function header comments should include a description of what the function does, the name and a short description of each parameter, and a description of the return value.

Electronically submit the following file to your in "handin" directory by the due date and time (or refer to the late policy):

• Student.h containing your updated header file for the Student class,
• Student.cpp containing your updated source code for the Student class,
• SortedList.h containing your updated header file for the SortedList class, and
• SortedList.cpp containing your updated source code for the SortedList class.
  
  
• If you are working with a partner, only one partner submits the program files, but both partners must submit to his/her own hand-in directory a completed README.txt file. Students working in pairs must follow the rules for pair programming.

Please turn in only the files named above. Extra files clutter up the "handin" directories.