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 |
|---|---|---|---|---|---|---|---|---|---|
| 30227R | 048 | Quiz | 5:00-7:20pm | Friday | 539 of 575 | TBA |  | ||
| 30177D | 048 | Lecture | 5:00-7:20pm | Tuesday | 315 of 331 | Victor Adamchik | SGM123 |   | |
| 30090R | 048 | Discussion | 7:30-8:20pm | Tuesday | 316 of 333 | Victor Adamchik | SGM123 | | |
| 30395D | 048 | Lecture | 5:00-7:20pm | Wednesday | 224 of 244 | Victor Adamchik | SGM124 | | |
| 30089R | 048 | Discussion | 7:30-8:20pm | Wednesday | 222 of 244 | Victor Adamchik | SGM124 | | |
| 30099D | 034 | Lecture | 5:00-7:20pm | Wednesday | 28 of 34 | Victor Adamchik | DEN@Viterbi | | |
| 29952R | 034 | Discussion | 7:30-8:20pm | Wednesday | 29 of 34 | DEN@Viterbi | | ||
| 29953R | 034 | Quiz | 5:00-7:20pm | Friday | 28 of 34 | DEN@Viterbi | |