CSCI 160 Programming Exercise 3,   Fall 2005

DUE:  
The assignment is due on or before midnight,  Monday Dec 5.  This
assignment is worth 20 objective points.  Your solution will be graded
on the basis of its run-time behaviour and on the clarity and
simplicity of the source code.  See the marking guide in
~pwalsh/Pex3/markingGuide. With regard to simplicity and clarity,
follow the ASAP principle: as simple as possible.

INSTRUCTIONS:
Issue the command:
               cp -r ~pwalsh/Pex3 .

to copy the programming exercise work directory to your account.
Locate to Pex3 (enter the command  cd Pex3) and use the CSCI 160
Exercise Development Utility to test, verify and submit your
programming exercise.

QUESTION:
Description
===========

The file tel.C contains a telephone directory program implemented using
a linked list.  In class, we discussed the use of a dummy node at the
head of  a linked list.  You must  use a dummy node to advantage AND
only add/delete to/from the head (after the dummy) of the list.

Your task is to modify the program as follows:

1. FindPos must be recursive.
2. The linked list is to have a dummy first node.
3. AddName adds a node to the head of the list (after the dummy).
4. DelName deletes a node from the head of the list (after the dummy).

Assumptions/Restrictions 
========================

All the I/O routines are complete (you may NOT employ
any I/O routine other then the ones provided).
The dummy node is never deleted.

 
Test Set 
======== 

none