Computer Science 270:
Introduction to Algorithms and Theory of Computing (4.0 units)
Algorithm analysis. Greedy algorithms, divide and conquer, dynamic programming, graph algorithms. NP-completeness and basic recursion theory and undecidability. Sorting lower bounds. Number-theory based cryptography.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29927R | 055 | Lecture | 2:00-4:00pm | MWF | 21 of 30 | Aaron Cote | GFS118 |   | |
| 29928R | 055 | Discussion | 2:00-4:00pm | Tuesday | 21 of 30 | GFS118 | | ||
| 29954R | 055 | Quiz | TBA | TBA | 21 of 30 | OFFICE | |