The George Washington University
School of Engineering and Applied Science
Department of Electrical Engineering and Computer Science

CSci 131 - Data Structures
Week 9 Homework

1. Indicate which of the problems in week 7, problem 1, requires a keyed table for its solution.

2. Instantiate the package Tables_Generic_List in section 9.4 for a telephone directory. Define a record containing a fifteen character first name, a fifteen character last name and a seven digit telephone number. The last name should be the key field. Write the necessary function to extract the key from the record.

3. Rewrite problem 5 from week 8 homework using recursion instead of iteration.

4. What is the big-O of the procedure in problem 3, with respect to both execution time and memory utilization.

5. Compare the sequentially allocated keyed table with the keyed table implemented with a linked list. What are the advantages of each implementation?