Project 2 (paper)

Due: Last day of classes.

This project involves the implementation and evaluation of a specific algorithm. You must choose an algorithm to implement that was not covered in class. You must present the theoretical correctness/efficiency of your algorithm and give an overview of your implementation in class.

Items to hand in

• The implementation of the data structure/algorithm.

• A driver for your data structure/algorithm.

• Your test data and resulting output of your implementation.

• Data used to evaluate the performance of your implementation.

• A write up that includes:
  • An algorithm.

  • A description of your test plan and an explaination of your results.

  • A written evaluation of the performance of your implementation.

  • A theoretical evaluation of the correctness as well as the time and space efficiency of your algorithm.

  • A comparison of your algorithm and implementation with other algorithms/implementations that perform the same task. This write-up must include a description of the problems that the algorithm/ data structure solves and examples of it's use.

Return to John Barr's Home Page

Last Modified: 22 August 2001

THIS PAGE MAINTAINED BY: John Barr, Ithaca College