Look here for a directory listing of all assignments. Assignments with missing due dates are not yet available. The readings are listed in the order the book will be covered.

• Assignment #1, part 1a due Jan. 10, part 1b due Jan. 12. Example input and output for part 1b.
• Reading: Lewis & Chase, Chap 1 and 2 for 1/5. Chapter 3 and 4 for 1/10.
• Reading (for 1/12): Lewis & Chase, Chap 8. We will cover the indexed list ADT from chapter 8, before going back to cover chapters 6 and 7.
• Assignment #2, due (1/19). The starter zip file containing code.
• Reading: Lewis & Chase, Chap 6 and 7, for 1/12
• Reading: Lewis & Chase, Chap. 10, (recursion) (for 1/19). We will also review induction, and proofs.
• Reading: Chap 11 (for 1/24).
• Assignment #3, due (1/26).
• Homework #4, due (2/2) Lewis and Chase sorting code.
• Homework #5 , due (2/21). Starter zip file containing code. .
• We will cover AVL trees followed by red-black trees. Read sections 13.4-13.7
• Reading: Hashing, chapter 17.
• Homework #6 , plus starter code, Due (3/1). Also, for your reference, here is the HashTableSet.java implementation we looked at.
• Heaps and priority queues are next; read chapter 15.
• Next is Chapter 16, with multiway search trees.
• Our final chapter is 18, where we will cover graphs, how to store them,  and at least DFS and BFS traversal algorithms. 
• Homework #7, due (3/9)