COP-3530, Data Structures Assignments
-
Assignment #1: Due Tue. May 25
- This is the main program that you
MUST use.
You may not alter it in any way.
-
Assignment #2: Due Tue. June 8: Collections
- Midterm: Tue. June 22
-
Assignment #3: Due Thu. June 24: Recursion
- Assignment #4: Due Thu. July 8: Search Trees
-
Download assign4.jar,
and place it (the jar file name, assign4.jar) on your classpath.
The test program is Assign4 which you can run once the jar file
is on the classpath (or
you can invoke Assign4.main from another program).
Of course, the cop3530
package must reside in a directory named cop3530
that is also on the classpath. If all else fails, you can extract
the class files from the jar file, but there is no reason why you
should have to do this.
-
Assignment #5: Due Tue. July 27: Shortest Paths
- Dictionary file: words.txt;
taken from the Internet...
I have not screened this file... there may be offensive words...
if so this is not intentional.
- Word pairs to check (run each with four sets of penalties: 1, 2, 4, 100).
- below, below
- yeast, beast
- green, breed
- green, blood
- three, seven
- three, eight
- three, forty
- crush, break
- words, graph
- chaos, order
- angle, areas
- bleed, filler
- two, seven
- fix, break
-
Assignment #6: Due Thu. August 5: Priority Queues and Sorting
-
Final Examination: Thursday August 12