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 |
|---|---|---|---|---|---|---|---|---|---|
| 29919R | 055 | Lecture | 1:40-3:00pm | MWThF | 36 of 50 | Aaron Cote | ONLINE |  | |
| 29920R | 055 | Discussion | 1:40-3:40pm | Tuesday | 36 of 50 | ONLINE | | ||
| 29921R | 055 | Quiz | TBA | TBA | 36 of 50 | TBA | |