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 |
|---|---|---|---|---|---|---|---|---|---|
| 30109R | 001 | Lecture | 3:30-4:50pm | Mon, Wed | 92 of 220 | Mate Szabo | THH101 |  | |
| 30361R | 001 | Discussion | 10:00-11:50am | Friday | 44 of 110 | THH301 | | ||
| 30362R | 001 | Discussion | 12:00-1:50pm | Friday | 48 of 110 | THH102 | | ||
| 30029R | 001 | Quiz | 7:00-8:50pm | Thursday | 92 of 220 | SAL101 | | ||
| 30190R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 54 of 70 | Jiapeng Zhang | LVL17 | | |
| 30363R | 001 | Discussion | 2:00-3:50pm | Friday | 54 of 70 | THH301 | | ||
| 30222R | 001 | Quiz | 7:00-8:50pm | Thursday | 54 of 70 | GFS116 | |