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 |
---|---|---|---|---|---|---|---|---|---|
30101D | 048 | Lecture | 5:00-6:50pm | Mon, Wed | 329 of 330 | Shahriar Shamsian | SGM123 | ||
30102D | 048 | Lecture | 7:00-8:50pm | Mon, Wed | 327 of 330 | Shahriar Shamsian | SGM123 | ||
29915R | 048 | Discussion | TBA | TBA | 656 of 660 | OFFICE | |||
29923R | 048 | Quiz | 7:00-8:50pm | Friday | 656 of 660 | TBA | |||
30099D | 034 | Lecture | 5:00-6:50pm | Mon, Wed | 39 of 45 | Shahriar Shamsian | DEN@Viterbi | ||
30253R | 034 | Discussion | TBA | TBA | 39 of 45 | DEN@Viterbi | |||
30152R | 034 | Quiz | 7:00-8:50pm | Friday | 39 of 45 | DEN@Viterbi |