CS 1321 (Principles of Algorithm Design II):
Homework #9 Sample Solution

Sample solution code

Testing

All of this is somewhat moot given that no one turned in code that would compile. If anyone had, this is how it would have been tested.

Note that both programs to be used for testing use URL.h.

Testing the hashTable class

We would have tested the hashTable class with a test program, Here is the code for the test program:

• test-hashTable.cc.

The test program requires input from standard input. We would have run the program with several different input files:

• test-hashTable.in1.
• test-hashTable.in2.
• test-hashTable.in3.
• test-hashTable.in4.
• test-hashTable.in5.
• test-hashTable.in6.
• test-hashTable.in7.

Here is a directory containing data files corresponding to the "URL"s named in the test input:

• data.

And here is the expected output:

• test-hashTable.in1.expected-out.
• test-hashTable.in2.expected-out.
• test-hashTable.in3.expected-out.
• test-hashTable.in4.expected-out.
• test-hashTable.in5.expected-out.
• test-hashTable.in6.expected-out.
• test-hashTable.in7.expected-out.

Testing the findDuplicates program

We would have tested the findDuplicates program (generated by compiling the provided findDuplicates.cc with your hashTable class) by executing it twice, once with each of the following files as its command-line argument:

• findDuplicates.List1.
• findDuplicates.List2.

Here is the expected output:

• findDuplicates.List1.expected-out.
• findDuplicates.List2.expected-out.