- Textbook:
Graham, Knuth, and Patashnik: Concrete Mathematics: A Foundation for Computer Science, 2nd Ed., Addison-Wesley, 1994
- References:
- D.E. Knuth: The Art of Computer Programming, 1: Fundamental Algorithms, 3rd Ed., Addison-Wesley, 1997
- D.E. Knuth: The Art of Computer Programming, 2: Seminumerical Algorithms, 3rd Ed., Addison-Wesley, 1997
- D.E. Knuth: The Art of Computer Programming, 3: Sorting and Searching, 2nd Ed., Addison-Wesley, 1998
- D. Green and D.E. Knuth: Mathematics for the Analysis of Algorithms, 3rd Ed., Birkhauser, 1990
- R. Sedgewick and P. Flajolet: An Introduction to the Analysis of Algorithms, 2nd Ed., Addison-Wesley, 2013
- P. Flajolet and R. Sedgewick: Analytic Combinatorics, Cambridge University Press, 2009
- Syllabus:
- Recurrences
- Sums
- Integer Functions
- Elementary Number Theory
- Binomial Coefficients, Hypergeometric Functions
- Special Numbers
- Generating Functions
- Discrete Probability
- Asymptotics
- Mathematical Analysis of Fundamental Algorithms
- TAs:
- 蕭睆文 : Office hours: (二) 9:00--10:00, R107; Email: d08922001@g.ntu.edu.tw
- Google meet online class link:
- Handouts:
- Chapter 1, Recurrences: chap 1.pdf
- Chapter 2, Sums: chap 2.pdf,
guess.pdf
- Chapter 3, Integer Functions: chap 3.pdf
- Chapter 4, Number theory: chap 4.pdf
- Chapter 5, Binomial coefficients: chap 5.pdf
- Chapter 6, Special numbers: chap 6.pdf
- Chapter 7, Generating functions: chap 7.pdf
- Chapter 8, Discrete Probability: chap 8.pdf,
bst.pdf
- Chapter 9, Asymptotics: chap 9.pdf
- Homeworks:
- Homework 1: Hw1.pdf, (due day: 2/27)
- Homework 2: Hw2.pdf, (due day: 3/5)
- Homework 3: Hw3.pdf, (due day: 3/12)
- Homework 4: Hw4.pdf, (due day: 3/26)
- Homework 5: Hw5.pdf, (due day: 4/2)
- Homework 6: Hw6.pdf, (due day: 4/16)
- Homework 7: Hw7.pdf, (due day: 4/30)
- Homework 8: Hw8.pdf, (due day: 5/14)
- Homework 9: Hw9.pdf, (due day: 5/28)
- Homework 10: Hw10.pdf, (due day: 6/7)