Computer Science 570:
Analysis of Algorithms (3.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.
- Note: Register for lecture and discussion.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 30331R | 901 | Lecture | 1:00-2:40pm | MTuWTh | 42 of 76 | Shahriar Shamsian | OHE136 |    | |
| 30042R | 901 | Discussion | TBA | TBA | 42 of 76 | OFFICE | | ||
| 30332D | 909 | Lecture | 1:00-2:40pm | MTuWTh | 10 of 20 | Shahriar Shamsian | DEN@Viterbi | | |
| 30043R | 909 | Discussion | TBA | TBA | 10 of 20 | DEN@Viterbi | |