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 | 5:00-7:40pm | Friday | 20 of 30 | Shahriar Shamsian | OFF CAMPUS | Word (26112 KB) |   |
| 30100D | 048 | Lecture | 9:30-10:50am | Tue, Thu | 59 of 72 | Leana Golubchik | VKC156 |  | |
| 30101D | 048 | Lecture | 5:00-7:40pm | Friday | 80 of 80 | Shahriar Shamsian | OHE136 | Word (26112 KB) | |
| 30102D | 048 | Lecture | 3:30-4:50pm | Mon, Wed | 35 of 50 | David Kempe | SGM601 | PDF (66768 KB) | |
| 30103D | 048 | Lecture | 11:00-12:20pm | Tue, Thu | 52 of 67 | Leana Golubchik | VKC150 | | |
| 30105D | 048 | Lecture | 6:00-8:50pm | Monday | 73 of 73 | Shahriar Shamsian | VKC156 | Word (26112 KB) | |
| 30231R | 034 | Discussion | 10:00-11:50am | Friday | 114 of 140 | Leana Golubchik | MRF340 | |