Project Topic Proposal Form (CSE 373, Autumn 2004)
Partner 1's last name, first name, UWNetID:
,
;
Partner 2's last name, first name:
,
;
Type of project:
Application of a qualifying technique
In-depth study of a qualifying technique
Comparison of two or more qualifying techniques
Qualifying technique:
Red-black trees
B-trees
Union-Find ADT
Huffman coding
Mergeable heaps (see p.481)
Boyer-Moore pattern matching
Knuth-Morris-Pratt pattern matching
Compressed Tries
Suffix Tries
Weight graph search
Minimum spanning trees
Finding maximal independent sets (see p.653)
Bipartiteness finding (see p.656)
Other (describe below and justify)
Describe your project here. If doing an application, what is the application and how will you apply the technique? If using multiple techniques, what are the others? What is the main structure that the user will see in the applet's scrolled pane?