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 |
|---|---|---|---|---|---|---|---|---|---|
| 29957R | 001 | Lecture | 4:00-6:20pm | Monday | 152 of 160 | Shahriar Shamsian | SGM101 |   | |
| 30009R | 001 | Lecture | 4:00-6:20pm | Wednesday | 159 of 160 | Shahriar Shamsian | THH301 | | |
| 30267R | 001 | Discussion | 10:00-11:50am | Friday | 105 of 107 | SGM101 | | ||
| 30268R | 001 | Discussion | 12:00-1:50pm | Friday | 102 of 107 | GFS106 | | ||
| 30269R | 001 | Discussion | 2:00-3:50pm | Friday | 104 of 107 | THH202 | | ||
| 30224R | 001 | Quiz | 6:00-7:50pm | Friday | 311 of 320 | TBA | |