CMSC 341 -- Fall 2002 -- Project 2

Copy this file into your directory and edit it to add your answers to the
following questions about project 2.

These questions count for 10% of your project grade.

1. (5 points) Given only a concordance (and not the text file from
   which it was constructed), sketch an algorithm to retrieve the
   words that appear on a given line.  What's the asymptotic
   performance of your algorithm?

2. (5 points) We could have implemented a concordance as an
   association list (from project 1) in which the keys are words and
   the values are lists of locations.  How would the computational
   complexity of this approach compare to the complexity of your
   implementation for operations like adding locations and printing
   the concordance?