Programming Assignment 2

Due: Mar. 15 before class starts

Description

In this assignment, you are to finish implementing three associative data structures: SortedTableMap, ProbeHashMap, and TreeMap. You are to test your implementations by finishing implementation of a generic unit test for map. Last, you will run experimentation between these and two other associative data structures: UnsortedTableMap and ChainHashMap to analyze time complexity of major operations of these structures to gain an intuitive feel for the pros and cons of each. You will make a report of your findings.

This program may be a pair assignment. Please let the instructor know of the pairs as early as possible. There may only be more than two in extreme circumstances. Pairs will be required to do a little more, but will turn in a single report and single zip file of the code.

Program Requirements

• Starting code is found here.
• Put your name at the top of any file you edit with a comment block.
• You can make all of the code at once with the command make, all of the documentation again with the command make docs.
• Comments with TODO define all necessary tasks to complete the data structures, but there is not much hints beyond that. Each structure is pretty much bare bones and gives no hint as to how to finish the implementation. Some items to consider:
  • Code documentation. Nice output will be found in Docs. Open index.html in your web browser of choice to see an interactive documentation system. Please note all comments, some tell how the functions should be implemented, what variable names mean, etc.
  • Textbook implementation of data structures (note these may not match 100%).
• Design a single unit test for each of a map's operations (4 in total) in TestMap.java that checks correctness of the most common use case for an operation. Pairs: you are required to additionally create new unit tests for edge cases.
• Make a program Timing.java for your experimentation. This should be extremely similar to the one you did in Program 1.

Report Requirements

Your report will include the objective of the assignment, brief description of your implementation, and a discussion of your results (theoretical and experimental). At a minimum your report should include the following organized into sections. Use a technical writing style and typeset your report in LaTeX. In this report, you are to design your own experiment to analyze big-oh complexity of a common map operation and discover the differences between the associative containers. Pairs: you are required to design two experiments and analyze two different operations.

• Introduction. In this section, state or describe the objective of the assignment, a statement about what you learned in the assignment, and a statement summarizing your results.
• Implementation details. Give a brief description of how you implemented the assignment, including what you learned.
• Theoretical analysis. In this section, you should provide a theoretical analysis (i.e., Big-Oh) for each of the five associative containers in regards to your experiment(s). You do not need to reason about memory complexity.
• Experimental Setup. In this section, you should provide a description of your experiment setup, which includes but is not limited to Machine specification, i.e., processor type, amount of ram, OS, etc.
• Results & Discussion. In this section, you will compare the performance of the various data structures. Include and discuss the following plots connecting data back to theoretical discussions per designed experiment:
  • Plot input size vs. time to give an overall look and comparison between the five data structures. Please put all five on the same plot.
  • Plot input size vs. time/expected time to determine the Big-Oh constants. Put all five data structures in one plot (if possible).
  For operations which take O(n2) test the following input sizes: 21, 22, ..., 216. For operations which take O(n), O(log n), or O(1) test the following input sizes: 21, 22, ..., 223.
• Conclusion. Summarize your findings.