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 |
|---|---|---|---|---|---|---|---|---|---|
| 29958D | 634 | Lecture | 1:00-3:25pm | TuWTh | 55 of 70 | Victor Adamchik | OHE136 |   | |
| 30063D | 634 | Lecture | 1:00-3:25pm | TuWTh | 11 of 70 | Victor Adamchik | WPHB27 |  | |
| 29959R | 634 | Discussion | TBA | TBA | 66 of 140 | OFFICE | | ||
| 29960R | 634 | Quiz | TBA | TBA | 66 of 140 | OFFICE | | ||
| 29961D | 586 | Lecture | 1:00-3:25pm | TuWTh | 4 of 20 | Victor Adamchik | DEN@Viterbi | | |
| 29962R | 586 | Discussion | TBA | TBA | 4 of 20 | OFFICE | | ||
| 29963R | 586 | Quiz | TBA | TBA | 4 of 20 | OFFICE | | ||
| 30331D | 901 | Lecture | 1:00-3:50pm | MTuW | 36 of 40 | Shahriar Shamsian | OHE100C | | |
| 30042R | 901 | Discussion | TBA | TBA | 36 of 40 | OFFICE | | ||
| 30049R | 901 | Quiz | TBA | TBA | 36 of 40 | OFFICE | | ||
| 30164D | 909 | Lecture | 1:00-3:50pm | MTuW | 10 of 20 | Shahriar Shamsian | DEN@Viterbi | | |
| 30171R | 909 | Discussion | TBA | TBA | 10 of 20 | DEN@Viterbi | | ||
| 30165R | 909 | Quiz | TBA | TBA | 10 of 20 | DEN@Viterbi | |