Syllabus.

LECTURES

1. Thursday, September 25. Hello. Priority queues. Heaps. Amortized analysis.
   
   
2. Tuesday, September 30. Amortized analysis. Binomial heaps, Fibonacci heaps. (Updated Oct. 7)
3. Thursday, October 2. Quiz 1. Fibonacci heaps.
   
   
4. Tuesday, October 7. Fibonacci heaps.
5. Thursday, October 9. Dictionary data structures. Splay trees.
   
   
6. Tuesday, October 14. Splay trees. Hashing.
7. Thursday, October 16. Quiz 2. Splay trees. Hashing.
   
   
8. Tuesday, October 21. Union-Find.
9. Thursday, October 23. Union-Find, analysis. Maximum flow.
   
   
10. Tuesday, October 28. Maximum flow. Algorithms of Edmonds-Karp, Dinic , and three Indians.
11. Thursday, October 30. Quiz 3. Maximum flow, cont.
    
    
12. Tuesday, November 4. Maximum bipartite matching.
    An example ...
13. Thursday, November 6. Greedy algorithms.
    
    
14. Tuesday, November 11. Holiday, no class.
15. Thursday, November 13. Greedy algorithms.
    
    
16. Tuesday, November 18. Quiz 4. Dynamic programming.
17. Thursday, November 20. Dynamic programming.
    
    
18. Tuesday, November 25. Divide and conquer.
19. Thursday, November 27. Thanksgiving, no class.
    
    
20. Tuesday, December 2. Primality testing.
21. Thursday, December 4. Public-key cryptography and the RSA.

HOMEWORKS

• Homework 1 (revised 10/08/08, 9PM), Due date postponed to Tuesday, October 14.
  Sources: hw1.tex, macros.tex (in parent directory), amortized.pdf, amortized.graffle
  Solutions
• Homework 2 Due Thursday, October 23.
  Sources: hw2.tex, macros.tex (in parent directory),
  hw2_fib_heap.pdf, hw2_fib_heap.graffle, hw2_splay_tree.pdf, hw2_splay_tree.graffle
• Homework 3 Due Thursday, November 6.
  Sources: hw3.tex, macros.tex (in parent directory),
  hw3_dinic.pdf, hw3_dinic.graffle
• Homework 4 Due Thursday, November 20.
  Sources: hw4.tex, macros.tex (in parent directory)
  Hint for Problem 1
• Homework 5 Due Thursday, December 4.
  Sources: hw5.tex, macros.tex (in parent directory)

QUIZES

• Quiz 1, October 2.
  Solutions
• Quiz 2. October 16.
• Quiz 3. October 30.
• Quiz 4. November 18. DATE CHANGE!

• Entrance Quiz sample 1
• Entrance Quiz sample 2
• Entrance Quiz sample 3
• Quiz 2 sample problems
• Quiz 3 sample problems
• Quiz 4 sample problems
• Other sample problems for quizzes
• Final Test sample 1
• Final Test sample 2

We will use the cs218 moodle page for discussions related to the class material. All students are required to sign up.
If you have any questions or information that may be of interest to other students, please post it there.

• Homework Template in LaTeX: source file HwSample.tex , and picture in pdf HwSampleGraph.pdf
• A short LaTeX manual (pdf)
• Most figures in the notes and homeworks will be done with omnigraffle, and graffle source files will be made available.
  If you use a mac, omnigraffle is recommended. It's powerful and not expensive and you will find it useful beyond cs218.
  You can also use xfig or jfig (both free) to produce figures in pdf to include in latex documents.

• Algorithms, book by S. Dasgupta, C. Papadimitriou, and U. Vazirani.
• Linear programming solver lpsolve
• The RSA Security
• Compression algorithms
• NIST dictionary of algorithms
• CRC Guide by Ross Williams
• Some primes (will come handy)
• Analysis of algorithms home page at INRIA
• Lots of info on different algorithms (Kent State)
• Algorithms animation
• Some applets for graph algorithms
• Computational geometry algorithms
• "Do software engineers need mathematics?" by K.Devlin.