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.
- Prerequisite: CSCI 104 and CSCI 170
- Note: Course Website: bytes.usc.edu/cs270/
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29957D | 001 | Lecture | 12:30-1:50pm | Mon, Wed | 86 of 140 | David Kempe | MRF340 |   | |
| 30009D | 001 | Lecture | 3:30-4:50pm | Mon, Wed | 49 of 160 | David Kempe | THH201 | | |
| 30267R | 001 | Discussion | 10:00-11:50am | Friday | 43 of 100 | SGM101 | | ||
| 30268R | 001 | Discussion | 12:00-1:50pm | Friday | 67 of 100 | GFS106 | | ||
| 30269R | 001 | Discussion | 2:00-3:50pm | Friday | 25 of 100 | THH202 | | ||
| 30224R | 001 | Quiz | 6:00-7:50pm | Friday | 135 of 300 | TBA | |