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 |
|---|---|---|---|---|---|---|---|---|---|
| 29909R | 051 | Lecture | 1:00-3:30pm | MWF | 20 of 40 | Aaron Cote | GFS207 |  | |
| 29910R | 051 | Discussion | 1:00-3:30pm | Tuesday | 20 of 40 | VKC100 | | ||
| 29911R | 051 | Quiz | TBA | TBA | 20 of 40 | OFFICE | |