- Homework 1: Algorithm Analysis hw1.pdf Due Monday, 2/6/2012
- Homework 2: Binary Search Trees Due Monday, 2/20/2012
- Homework 3: Tree Traversals and Heaps hw3.pdf Due Friday, 3/02/2012, at start of class
- Homework 4: Sorted List Priority Queues Due Wednesday, 3/28/2012
- Homework 5: BFS and DFS Due Monday, 4/9/2012
- Project 1: Sparse Arrays Due 2/17/2012 and 2/24/2012
- Project 2: Huffman Coding Due 3/21/2012 (Midnight)
- Project 3: Dictionary Due 4/18/2012 (Midnight)
- Project 4: Network Due 5/9/2012 (Midnight)