CS 2401 Assignment #7

Due Date: Sunday, October 18, 2009.

Objective: The goal of this assignment is to practice linked lists.

Background: The main advantage of linked lists is that, in contrast to arrays, they allow the user to easily handle lists of arbitrary size, without a need to set up a prior bound. Let us use this ability to help our Computer Science department design a list of UTEP CS faculty with their research topics.

Assignment: The elements of your list are objects representing professors. Each such object should contains three fields:

For simplicity, let us assume that each professor has only one research area.

Write methods:

In the main program, test your methods by filling in information about at least six actual UTEP CS professors. To test deletion, add Ada Lovelace, then delete her.

For extra credit: add: