notes

• Thu Jan 23 - intro class
• Tue Jan 29 - algorithms 101 & tools
• Thu Jan 31 - O() and numerical experiment practice
• Tue Feb 5 - data structures
• Thu Feb 7 - ... continued
• Tue Feb 12 - linked list homework; heapsort, mergesort, quicksort
• Thu Feb 14 - ... finish sorting with in class code examples
• Tue Feb 19 - start graphs (chap 5 & 6 in Skienna's text)
• Thu Feb 21 - sorting homework; start on code for graphs
• Tue Feb 26 - more graph algorithms
• Thu Feb 28 - Prim's, Kruskal's, Dijkstra's, Floyd's
• Tue Mar 5 - No class - Vermont Town Meeting day
• Thu Mar 7 - continue with Dijkstra's, Floyd's
• Tue Mar 11 - prims2, review, Floyd's
• Thu Mar 14 - last day with graphs
• .. spring break ..
• Tue Apr 2 - backtrack
• Thu Apr 4 - heuristic search
• Tue Apr 9 - min/max & alpha/beta game search
• Thu Apr 11 - backtrack anagram homework & games
• Tue Apr 16 - dynamic programming
• Thu Apr 18 - continue
• Tue Apr 23 - dynamic homework & explain hash tables
• Thu Apr 25 - finish hash tables; start crypto
• Tue Apr 30 - continue crypto
• Thu May 2 - ditto
• Tue May 7 - project presentations