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 | 902 | Lecture | 3:00-5:50pm | MWTh | 100 of 120 | Shahriar Shamsian | OHE122 |   | |
| 29929R | 902 | Discussion | TBA | TBA | 100 of 120 | OFFICE | | ||
| 29930R | 902 | Quiz | TBA | TBA | 100 of 120 | OFFICE | | ||
| 29931D | 910 | Lecture | 3:00-5:50pm | MWTh | 35 of 40 | Shahriar Shamsian | DEN@Viterbi | | |
| 29932R | 910 | Discussion | TBA | TBA | 35 of 40 | DEN@Viterbi | | ||
| 29933R | 910 | Quiz | TBA | TBA | 35 of 40 | DEN@Viterbi | | ||
| 29970R | 902 | Lecture | 3:00-5:50pm | MWTh | 22 of 100 | Shahriar Shamsian | SLH200 |  | |
| 29971R | 902 | Discussion | TBA | TBA | 22 of 100 | OFFICE | | ||
| 29972R | 902 | Quiz | TBA | TBA | 22 of 100 | OFFICE | |