notes

• Thu Jan 22 - intro class
• Tue Jan 27 - getting started
• Thu Jan 29 - analysis & big-O notation
• Tue Feb 3 - finish big-O; start stack/queue/list
• Thu Feb 5 - linked lists and C
• Tue Feb 10 - homework ; start recursion chapter
• Thu Feb 12 - continue recursion
• Tue Feb 17 - homework (knapsack); start search & hash
• Thu Feb 19 - edit distance ; search & hash
• Tue Feb 24 - homework (string edit distance, binary search, hash table); start sorting
• Thu Feb 26 - sorting nitty-gritty
• Tue Mar 3 - start trees & heaps
• Thu Mar 6 - continue binary trees & binary heaps
• Tue Mar 10 - balanced binary search trees
• Thu Mar 12 - binary tree rotations
• spring break
• Tue Mar 31 - start graphs
• Thu Apr 2 - continue graphs
• Tue May 5 - last class / review / open
• Tue Apr 7 - "shortest" graph algorithms : Prim's, Dijkstra's, etc
• Thu Apr 9 - continue graph algorithms ; start game search
• Tue Apr 14 - game search and A*
• Thu Apr 16 - chomp
• Tue Apr 21 - huffman coding
• Thu Apr 23 - implementing huffman
• Tue Apr 28 - LZW compression
• Thu Apr 30 - implementing LZW
• Tue May 5 - review / open discussion