Computer Science 570:
Analysis of Algorithms (4.0 units)
Explores fundamental techniques such as recursion, Fourier transform ordering, dynamic programming for efficient algorithm construction. Examples include arithmetic, algebraic, graph, pattern matching, sorting, searching algorithms.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29928R | 527 | Lecture | 3:00-6:10pm | Mon, Wed | 48 of 210 | Shahriar Shamsian | SGM124 |   | |
| 29929R | 527 | Discussion | TBA | TBA | 48 of 210 | OFFICE | | ||
| 29930R | 527 | Quiz | TBA | TBA | 48 of 210 | OFFICE | | ||
| 29931D | 952 | Lecture | 3:00-6:10pm | Mon, Wed | 11 of 30 | Shahriar Shamsian | DEN@Viterbi | | |
| 29932R | 952 | Discussion | TBA | TBA | 11 of 30 | DEN@Viterbi | | ||
| 29933R | 952 | Quiz | TBA | TBA | 11 of 30 | DEN@Viterbi | |