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 |
|---|---|---|---|---|---|---|---|---|---|
| 29955R | 050 | Lecture | 12:00-1:40pm | MWThF | 12 of 50 | Aaron Cote | GFS118 |  | |
| 29956R | 050 | Discussion | 12:00-2:00pm | Tuesday | 12 of 50 | GFS118 | | ||
| 29957R | 050 | Quiz | TBA | TBA | 12 of 50 | OFFICE | |