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 |
|---|---|---|---|---|---|---|---|---|---|
| 29956R | 001 | Lecture | 3:30-4:50pm | Mon, Wed | 85 of 100 | David Kempe | MHP101 |   | |
| 29957R | 001 | Lecture | 12:30-1:50pm | Mon, Wed | 84 of 100 | David Kempe | THH202 | | |
| 30231R | 001 | Lecture | 6:00-7:20pm | Tue, Thu | 40 of 100 | Jiapeng Zhang | MRF340 | | |
| 30267R | 001 | Discussion | 10:00-11:50am | Friday | 50 of 100 | Jiapeng Zhang | SGM101 | | |
| 30268R | 001 | Discussion | 12:00-1:50pm | Friday | 93 of 100 | David Kempe | GFS106 | | |
| 30269R | 001 | Discussion | 2:00-3:50pm | Friday | 66 of 100 | David Kempe | THH202 | | |
| 30224R | 001 | Quiz | 7:00-8:50pm | Friday | 169 of 200 | David Kempe | TBA | | |
| 30385R | 001 | Quiz | 7:00-8:50pm | Friday | 40 of 100 | Jiapeng Zhang | TBA | |