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 |
|---|---|---|---|---|---|---|---|---|---|
| 30159R | 055 | Lecture | 12:00-1:20pm | MWThF | 25 of 30 | Aaron Cote |  | ||
| 30160R | 055 | Discussion | 12:00-2:00pm | Tuesday | 25 of 30 | | |||
| 30161R | 055 | Quiz | TBA | TBA | 25 of 30 | OFFICE | |