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 |
|---|---|---|---|---|---|---|---|---|---|
| 30094R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 63 of 66 | Aaron Cote | SLH100 |  | |
| 30231R | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 56 of 58 | Aaron Cote | VKC100 | | |
| 30396D | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 59 of 61 | Aaron Cote | KDC240 | | |
| 30267R | 001 | Discussion | 10:00-11:50am | Friday | 65 of 70 | THH210 | | ||
| 30268R | 001 | Discussion | 12:00-1:50pm | Friday | 61 of 70 | THH208 | | ||
| 30269R | 001 | Discussion | 2:00-3:50pm | Friday | 52 of 70 | THH210 | | ||
| 30224R | 001 | Quiz | 7:00-8:50pm | Wednesday | 178 of 200 | TBA | |