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 |
|---|---|---|---|---|---|---|---|---|---|
| 30097D | 048 | Lecture | 12:30-1:50pm | Tue, Thu | 17 of 60 | William Cheng | GFS101 |   | |
| 30099D | 034 | Lecture | 2:00-3:20pm | Tue, Thu | 19 of 22 | Shahriar Shamsian | OFF CAMPUS | | |
| 30100D | 048 | Lecture | 12:30-1:50pm | Tue, Thu | 65 of 70 | Aaron Cote | SOSB46 |  | |
| 30101D | 048 | Lecture | 2:00-3:20pm | Tue, Thu | 62 of 70 | Aaron Cote | ZHS252 | | |
| 30177D | 048 | Lecture | 5:00-7:50pm | Monday | 62 of 70 | Shahriar Shamsian | THH208 | | |
| 30236D | 048 | Lecture | 2:00-3:20pm | Tue, Thu | 64 of 70 | Shahriar Shamsian | OHE136 | | |
| 30395D | 048 | Lecture | 9:30-10:50am | Tue, Thu | 58 of 60 | Aaron Cote | THH116 | |