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 |
|---|---|---|---|---|---|---|---|---|---|
| 29959D | 001 | Lecture | 12:00-1:20pm | Mon, Wed | 82 of 83 | Leonard Adleman | SLH102 |   | |
| 30361R | 001 | Discussion | 10:00-11:50am | Friday | 82 of 83 | GFS116 | | ||
| 30222R | 001 | Quiz | TBA | TBA | 82 of 83 | OFFICE | | ||
| 30105D | 001 | Lecture | 3:30-4:50pm | Tue, Thu | 35 of 37 | Joseph Bebel | VKC203 | | |
| 30263D | 001 | Lecture | 11:00-12:20pm | Tue, Thu | 54 of 56 | Joseph Bebel | VKC150 | | |
| 30264D | 001 | Lecture | 12:30-1:50pm | Tue, Thu | 73 of 74 | Joseph Bebel | LVL17 | | |
| 30362R | 001 | Discussion | 12:00-1:50pm | Friday | 80 of 85 | MRF340 | | ||
| 30363R | 001 | Discussion | 2:00-3:50pm | Friday | 82 of 82 | MRF340 | | ||
| 30029R | 001 | Quiz | 7:00-8:50pm | Thursday | 162 of 167 | TBA | |