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 | 4:30-5:50pm | Mon, Wed | 57 of 60 | Shahriar Shamsian | MHP101 |  | |
| 29957D | 001 | Lecture | 6:00-7:30pm | Mon, Wed | 54 of 60 | Shahriar Shamsian | MHP101 | | |
| 29958D | 001 | Lecture | 3:30-5:00pm | Tue, Thu | 57 of 60 | Shahriar Shamsian | THH210 | | |
| 30231D | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 59 of 60 | Shahriar Shamsian | GFS101 | | |
| 30267R | 001 | Discussion | 10:00-11:50am | Friday | 78 of 80 | SLH100 | | ||
| 30268R | 001 | Discussion | 12:00-1:50pm | Friday | 73 of 80 | ZHS159 | | ||
| 30269D | 001 | Discussion | 2:00-3:50pm | Friday | 76 of 82 | ZHS159 | | ||
| 30224R | 001 | Quiz | 7:00-8:50pm | Friday | 227 of 240 | TBA | |