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 | 12:30-1:50pm | Tue, Thu | 69 of 70 | Michael Shindler | GFS116 | PDF (126106 KB) |  |
| 29961D | 001 | Lecture | 9:30-10:50am | Tue, Thu | 68 of 70 | Michael Shindler | SOSB46 | PDF (126106 KB) | |
| 30109D | 001 | Lecture | 10:00-11:50am | Mon, Wed | 66 of 70 | Michael Shindler | WPHB27 | PDF (126106 KB) | |
| 30361R | 001 | Discussion | 10:00-11:50am | Friday | 68 of 70 | WPHB27 | | ||
| 30362R | 001 | Discussion | 12:00-1:50pm | Friday | 69 of 70 | SLH102 | | ||
| 30363R | 001 | Discussion | 2:00-3:50pm | Friday | 66 of 70 | SLH102 | | ||
| 30029R | 001 | Quiz | 7:00-8:50pm | Thursday | 203 of 215 | TBA | |