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 |
|---|---|---|---|---|---|---|---|---|---|
| 29956D | 001 | Lecture | 3:30-4:50pm | Mon, Wed | 121 of 123 | Shahriar Shamsian | THH101 & ONLINE |  | |
| 29957D | 001 | Lecture | 5:00-6:20pm | Mon, Wed | 115 of 121 | Shahriar Shamsian | THH201 & ONLINE | | |
| 30267D | 001 | Discussion | 10:00-11:50am | Friday | 79 of 82 | SAL101 & ONLINE | | ||
| 30268R | 001 | Discussion | 12:00-1:50pm | Friday | 79 of 80 | MHP101 & ONLINE | | ||
| 30269R | 001 | Discussion | 2:00-3:50pm | Friday | 78 of 81 | SAL101 & ONLINE | | ||
| 30224R | 001 | Quiz | 7:00-8:50pm | Friday | 236 of 243 | TBA & ONLINE | |