Data Structures and Algorithms II

Spring 2002 Assignments

Homework 5 - Sorting Due April 24

Homework 4 - Hashing

Program 3 - BTree Implementation Due April 7.
Note - A test driver can be downloaded here - this contains 3 files (test.h and test.cpp can overwrite any in your project. Driver.cpp is the actual test file.

Homework 3 - ofbitstream class

Program 2 - Kruskal's Minimum Spanning Tree Algorithm and the Union-Find Problem. Due Tuesday, March 5, at midnight.

Homework 2 - Finish the remove method in the MaxHeap class we designed in class. Here is the project. Submit a printed and documented version of the remove method on Monday, Feb 18.

Program 1 - Odd Words - Revised due date: Sunday, February 3, at midnight. 

Homework 1 - Stack ADT as part of the BST_Array. Here is the revised BST project from class 1/30/02 - You should complete the Stack class and make any necessary adjustments to cause the inOrder method to function properly. Provide a printout of the Stack.h file in Monday's class.