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 |
|---|---|---|---|---|---|---|---|---|---|
| 30177D | 048 | Lecture | 5:00-7:20pm | Monday | 325 of 331 | Shahriar Shamsian | SGM123 |    | |
| 30289R | 048 | Discussion | 7:30-8:20pm | Monday | 325 of 331 | SGM123 | | ||
| 30227R | 048 | Quiz | 8:00-9:50pm | Friday | 325 of 331 | TBA | | ||
| 30395D | 048 | Lecture | 5:00-7:20pm | Thursday | 317 of 330 | Shahriar Shamsian | SGM123 | | |
| 30290R | 048 | Discussion | 7:30-8:20pm | Thursday | 317 of 330 | | |||
| 30291R | 048 | Quiz | 7:00-8:50pm | Friday | 317 of 330 | TBA | | ||
| 30099D | 034 | Lecture | 5:00-7:20pm | Monday | 29 of 30 | DEN@Viterbi | | ||
| 29952R | 034 | Discussion | 7:30-8:20pm | Monday | 28 of 30 | DEN@Viterbi | | ||
| 29953R | 034 | Quiz | 8:00-9:50pm | Friday | 28 of 30 | DEN@Viterbi | |