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 |
|---|---|---|---|---|---|---|---|---|---|
| 30331D | 901 | Lecture | 1:00-3:05pm | MTuWTh | 63 of 76 | Shahriar Shamsian | OHE136 |    | |
| 30042R | 901 | Discussion | TBA | TBA | 63 of 76 | OFFICE | | ||
| 30049R | 901 | Quiz | TBA | TBA | 63 of 76 | OFFICE | | ||
| 30219D | 807 | Lecture | 2:30-5:20pm | MTuW | 32 of 45 | Michael Shindler | OHE100C |  | |
| 30220R | 807 | Discussion | TBA | TBA | 32 of 45 | OFFICE | | ||
| 30221R | 807 | Quiz | TBA | TBA | 32 of 45 | OFFICE | | ||
| 30032D | 909 | Lecture | 1:00-3:05pm | MTuWTh | 9 of 20 | Shahriar Shamsian | DEN@Viterbi | | |
| 30043R | 909 | Discussion | TBA | TBA | 9 of 20 | OFFICE | | ||
| 30050R | 909 | Quiz | TBA | TBA | 9 of 20 | OFFICE | |