Programming Assignment 7

Description

In this assignment, you are to experimentally analyze and report on the efficiency of the five associative data structures involved in Programming Assignment 5 and Programming Assignment 6: UnsortedTableMap, SortedTableMap, ChainHashMap, ProbeHashMap, and TreeMap.

• Use Timing.java (click here for file) as a basis for your experimental analysis.
• Perform one experiment: Adding n elements to each data structure.
• For the experiment provide plots and a table with the following information:
  • Input size vs time
  • Input size vs time/expected time - use this plot to gather Big-oh constants
  • Big-oh constants
  You may decide how to organize the information, e.g., all-in-one (2 plots and 1 table) or separated into Map and SortedMap implementations (recommended! 4 plots and 2 tables).
• Beyond the requirements of the report listed below:
  • You can earn up to 10 points as bonus for adding a second experiment to enhance your report. Clearly state in bold in the introduction that you have included a second experiment.

Turn-in list summary

• Soft copy (pdf) of report to blackboard
• Hard copy of report in class. Do not turn in a printout of Timing.java.