Course Program:
This course will take a random walk through various topics (especially mathematical topics) that come in handy for theoretical computer science. It is intended mainly for graduate students or strong undergraduates; who are interested in research in Theoretical Computer Science.
Prerequisites: It will be helpful for students to have a solid undergraduate background in math (e.g., elementary combinatorics, graph theory, discrete probability, basic algebra/calculus) and theoretical computer science (running time analysis, big-O/Omega/Theta, P and NP, basic fundamental algorithms). "Mathematical maturity" is important.
Textbook:
Grading:
| Homework 1 | 12% |
| Homework 2 | 12% |
| Homework 3 | 12% |
| Homework 4 | 12% |
| Homework 5 | 12% |
| Take-home final | 35% |
| Participation | 5% |
Additional Material:
Active course web page / bulletin board on Piazza: Please sign up at https://piazza.com/boun.edu.tr/fall2014/cmpe587/home
Course questionnaire, please complete by Monday, September 29:
https://docs.google.com/forms/d/1YBMLfJf29ppDLLBQqA9bJjB8D3n8Cft7PJf_Uid...
Homework 1:
http://www.cs.cmu.edu/~odonnell/cmpe587/homework1.pdf
Homework 2:
http://www.cs.cmu.edu/~odonnell/cmpe587/homework2.pdf
Homework 3:
http://www.cs.cmu.edu/~odonnell/cmpe587/homework3.pdf
Homework 4:
http://www.cs.cmu.edu/~odonnell/cmpe587/homework4.pdf
Homework 5:
http://www.cs.cmu.edu/~odonnell/cmpe587/homework6.pdf