Due Date: Monday, March 22, 2010, or Tuesday, March 23, 2010,
depending on the day of your lab..
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 maintain a catalog of future events for a concert hall
with the kind of the event (e.g., rock concert, classic concert, comedy, musical, play).
Assignment: The elements of your list are objects representing events.
Each such object should contains three fields:
For simplicity, let us assume that each event has only one type and that the list is not kept in chronological order.
- the event's name,
- the event's kind, and
- the event's date.
In the main program, test your methods by filling in information about at least six events that you would like to see at Don Haskins.
To test insertion and deletion, add Coldplay concert to the list, show that you can search for Coldplay, then delete Coldplay.
- for starting such a list,
- for inserting new events,
- for deleting events,
- for searching events of a kind, and
- for searching event(s) on a given date.
For extra credit: enforce that events are kept in chronological order.