CSCI 160 Assignment 6,   Fall 1996

Correction: LookUpName in the statement of the assignment should
read LookUpNumber.

DUE:  
The assignment is due on or before 3am, Thursday November 21.  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
~csci160/Pex6/markingGuide. With regard to simplicity and clarity,
follow the ASAP principle: as simple as possible.

INSTRUCTIONS:
Issue the command:
               cp -r ~csci160/Pex6 .
to copy the assignment work directory to your account.  Locate to Pex6
and use the  CSCI 160 Exercise Development Utility to test, verify and
submit you assignment (enter the command  make help for instructions on
how to use the utility). Note, the solution to last years assignment
is in ~csci160/Pex6.last_year. 

This assignment is to completed by each student.  Submit only one
implementation; if you send more than one, we will discard all but the
last one.  The assignment identifier is  CSCI 160 Pex 6 (see Course
Information Sheet).  Your assignment  must be received before the due
date and time.  In addition, your e-mail  must have the assignment
identifier as its subject.  All other methods of submission will not be
accepted.  You will receive no credit for an assignment submission that
fails to adhere to this convention.

QUESTION:
Description
===========
TelDirectory is a Pascal program that implements an online telephone
directory.  TelDirectory allows the user to add, delete, list and query
entries in the directory.  Each entry consists of a name and a
telephone number.  A skeleton of TelDirectory can be found in the Pex6
directory.  All the code is in place except for GetPos, AddName,
DelName and LookUpName. Your task is to write the code for these
procedures according to the specifications contained in their
respective comment blocks.
Sample Output
=============
All I/O procedures are completed and available in TelDirectory.  You
MUST use there procedures for input/output. See last year's solution
for the general output format. 
Assumptions/Restrictions 
========================
Input data need not be validated.  The telephone directory is to be
maintained in lexicographic order (key is last name).  Use insertion
sort to add names to the telephone directory.  Use binary search for
all queries to the telephone directory.  When adding a name or deleting
a name, you are allowed only one pass through the telephone directory.
Test Set
========
See the test set in ~csci160/Pex6.