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.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 30099D | 034 | Lecture | 3:30-4:50pm | Tue, Thu | 13 of 20 | Shahriar Shamsian | DEN@Viterbi |   | |
| 30101D | 048 | Lecture | 5:00-7:50pm | Wednesday | 71 of 71 | Shahriar Shamsian | GFS106 | | |
| 30102D | 048 | Lecture | 3:30-4:50pm | Tue, Thu | 71 of 72 | Shahriar Shamsian | OHE136 | | |
| 30105D | 048 | Lecture | 9:30-10:50am | Tue, Thu | 71 of 70 | William Cheng | SLH102 | | |
| 30202D | 048 | Lecture | 6:00-8:50pm | Wednesday | 71 of 72 | Michael Shindler | WPHB27 | | |
| 30231D | 048 | Lecture | 6:00-8:50pm | Tuesday | 70 of 70 | Michael Shindler | THH102 | | |
| 30252D | 048 | Lecture | 12:30-1:50pm | Tue, Thu | 72 of 70 | William Cheng | ZHS352 | |