notes

• Jan 20 - intro class
• Tue Jan 25 - O() notation ; getting started
• Thu Jan 27 - merge sort ; more C
• Tue Feb 1 - more C, more sorting
• Thu Feb 3 - discuss homework; start FFT
• Tue Feb 8 - FFT
• Tue Feb 15 - finish FFT; start structures
• Thu Feb 17 - C struct, typedef, malloc, pointer practic
• Tue Feb 21 - discuss homework. start graphs (chap 3), and some tools: graphviz (dot), gnuplot
• Thu Feb 24 - chapter 3 and 4 in Dasgupta: graphs, searches depth-first, breadth-first
• Tue March 1 - no class; Vermont Town Meeting Day
• Thu March 3 - breadth-first ; Dijkstra's shortest path ; heaps
• Tue March 8 - further discussion of graph algorithms
• Thu March 10 - discuss midterm projects, write-up expectations
• Tue March 28 - back from break
• Thu March 31 - Huffman and LZW codes
• Tue Apr 5 - finish compression discussion; discuss hash tables
• Thu Apr 7 - continue hash table discussion
• Tue Apr 12 - finish hash/C ; start crypto/number_theory
• Thu Apr 14 - continue crypto/number theory
• Tue Apr 19 - work through RSA
• Thu Apr 21 - finish up encryption
• Tue Apr 26 - start string search
• Thu Apr 28 - traveling salesman / Lin-Kernighan in python : an example
• Tue May 3 - final project presentations