15-251: Great Theoretical Ideas in Computer Science
| Units | 12 |
|---|---|
| Department | Computer Science |
| Prerequisites | (15-100 or 15-111) and 21-127 |
| Related URLs | http://www.csd.cs.cmu.edu http://www.cs.cmu.edu/~15251 |
This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. Assignments involve both mathematical proofs and programming. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
Sections
| Section | Time | Day | Instructor(s) | Location | |
|---|---|---|---|---|---|
| Lec | 03:00 pm – 04:20 pm | TR | Von Ahn Arellano, Gupta | DH 2315 |  |
| A | 10:30 am – 11:20 am | M | Instructor TBA | DH 1217 | |
| B | 11:30 am – 12:20 pm | M | Instructor TBA | DH 1217 | |
| C | 12:30 pm – 01:20 pm | M | Instructor TBA | DH 1217 | |
| D | 01:30 pm – 02:20 pm | M | Instructor TBA | DH 1217 | |
| E | 02:30 pm – 03:20 pm | M | Instructor TBA | SH 125 | |
| F | 03:30 pm – 04:20 pm | M | Instructor TBA | WEH 5302 | |
Textbooks
We don’t have textbooks yet. Check back closer to the beginning of Spring 2009.