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 |
|---|---|---|---|---|---|---|---|---|---|
| 29960D | 001 | Lecture | 11:00-12:20pm | Tue, Thu | 118 of 150 | David Kempe | SGM101 |  | |
| 30264D | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 133 of 150 | David Kempe | SGM124 | | |
| 30245D | 001 | Discussion | 8:00-9:50am | Friday | 6 of 1 | SOSB46 | | ||
| 30361R | 001 | Discussion | 10:00-11:50am | Friday | 78 of 90 | THH301 | | ||
| 30362R | 001 | Discussion | 12:00-1:50pm | Friday | 82 of 90 | THH301 | | ||
| 30363R | 001 | Discussion | 2:00-3:50pm | Friday | 85 of 90 | THH301 | | ||
| 30029R | 001 | Quiz | 7:00-8:50pm | Thursday | 251 of 300 | TBA | |