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 |
|---|---|---|---|---|---|---|---|---|---|
| 30395D | 048 | Lecture | 5:00-7:20pm | Wednesday | 320 of 330 | Shahriar Shamsian | SGM123 |   | |
| 30089R | 048 | Discussion | 7:30-8:20pm | Wednesday | 320 of 330 | SGM123 | | ||
| 30227R | 048 | Quiz | 5:00-6:50pm | Friday | 320 of 330 | TBA | | ||
| 30198D | 048 | Lecture | 5:00-7:20pm | Monday | 248 of 330 | Shahriar Shamsian | SGM123 | | |
| 30290R | 048 | Discussion | 7:30-8:20pm | Monday | 248 of 330 | SGM123 | | ||
| 30291R | 048 | Quiz | 5:00-6:50pm | Friday | 248 of 330 | TBA | | ||
| 30099D | 034 | Lecture | 5:00-7:20pm | Wednesday | 39 of 50 | Shahriar Shamsian | DEN@Viterbi | | |
| 29952R | 034 | Discussion | 7:30-8:20pm | Wednesday | 39 of 50 | DEN@Viterbi | | ||
| 29953R | 034 | Quiz | 5:00-6:50pm | Friday | 39 of 50 | DEN@Viterbi | |