Description
There are two components to this project:
- Submit a formal Paper (PDF) discussing one of the topics listed The paper should be 6 to 7 pages (single space) including source code snippets, images, and tables. Your paper must be well written and formatted in a manner that upholds Graduate level scholarship.
Organizational format should be as follows:
- Title
- Abstract (one or two paragraphs)
- Text
- Bibliography (minimum 4 published sources, excluding Wikipedia)
Select a topic that demonstrates your research/understanding of Java Data Structures in one of the following areas:
- Red-black trees o M-ary tree o Aa-tree
- Hash Table – Linear Probing o Skew heap
- D-heap o Dijkstra’s algorithm o Splay tree o B+ tree o Topological Sort
- Topic of your choice (I must approve)



