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 | 0 of 294 | Aaron Cote | THH201 |  | |
| 30009R | 001 | Lecture | 12:30-1:50pm | Tue, Thu | 0 of 319 | Aaron Cote | THH101 | | |
| 30095R | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 0 of 35 | Mate Szabo | WPH106 | | |
| 30267R | 001 | Discussion | 10:00-11:50am | Friday | 0 of 100 | SGM101 | | ||
| 30268R | 001 | Discussion | 12:00-1:50pm | Friday | 0 of 100 | GFS106 | | ||
| 30269R | 001 | Discussion | 2:00-3:50pm | Friday | 0 of 100 | THH202 | | ||
| 30224R | 001 | Quiz | 6:00-7:50pm | Friday | 0 of 648 | TBA | |