• Textbook: Graham, Knuth, and Patashnik: Concrete Mathematics: A Foundation for Computer Science, 2nd Ed., Addison-Wesley, 1994

         


• References:
  1. D.E. Knuth: The Art of Computer Programming, 1: Fundamental Algorithms, 3rd Ed., Addison-Wesley, 1997
  2. D.E. Knuth: The Art of Computer Programming, 2: Seminumerical Algorithms, 3rd Ed., Addison-Wesley, 1997
  3. D.E. Knuth: The Art of Computer Programming, 3: Sorting and Searching, 2nd Ed., Addison-Wesley, 1998
  4. D. Green and D.E. Knuth: Mathematics for the Analysis of Algorithms, 3rd Ed., Birkhauser, 1990
  5. R. Sedgewick and P. Flajolet: An Introduction to the Analysis of Algorithms, 2nd Ed., Addison-Wesley, 2013
  6. P. Flajolet and R. Sedgewick: Analytic Combinatorics, Cambridge University Press, 2009


• Syllabus:
  1. Recurrences
  2. Sums
  3. Integer Functions
  4. Elementary Number Theory
  5. Binomial Coefficients, Hypergeometric Functions
  6. Special Numbers
  7. Generating Functions
  8. Discrete Probability
  9. Asmptotics
  10. Mathematical Analysis of Fundamental Algorithms


• Handouts:
  1. Binary Search Trees:  bst.pdf
  2. Guessing method:  guess.pdf


• Homeworks:
  1. Homework 1:   Hw1.pdf, (due day: 3/5)