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 |
|---|---|---|---|---|---|---|---|---|---|
| 29957R | 001 | Lecture | 9:30-10:50am | Tue, Thu | 100 of 130 | Aaron Cote | THH201 |   | |
| 30009R | 001 | Lecture | 12:30-1:50pm | Tue, Thu | 130 of 130 | Aaron Cote | THH101 | | |
| 30267R | 001 | Discussion | 10:00-11:50am | Friday | 85 of 85 | SGM101 | | ||
| 30268R | 001 | Discussion | 12:00-1:50pm | Friday | 95 of 95 | GFS106 | | ||
| 30269R | 001 | Discussion | 2:00-3:50pm | Friday | 55 of 85 | THH202 | | ||
| 30224R | 001 | Quiz | 6:00-7:50pm | Friday | 235 of 260 | TBA | | ||
| 30095R | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 9 of 35 | Mate Szabo | WPH106 | | |
| 30166R | 001 | Discussion | 12:00-1:50pm | Friday | 4 of 35 | DMC101 | | ||
| 30385R | 001 | Quiz | 6:00-7:50pm | Friday | 4 of 35 | TBA | |