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-7:20pm | Monday | 325 of 330 | Shahriar Shamsian | SGM123 | ||
29928R | 048 | Discussion | 7:30-8:20pm | Monday | 325 of 330 | SGM123 | |||
29923R | 048 | Quiz | 5:00-6:50pm | Friday | 325 of 330 | TBA | |||
30102D | 048 | Lecture | 5:00-7:20pm | Wednesday | 319 of 330 | Shahriar Shamsian | SGM123 | ||
30342R | 048 | Discussion | 7:30-8:20pm | Wednesday | 319 of 330 | SGM123 | |||
30379R | 048 | Quiz | 5:00-6:50pm | Friday | 319 of 330 | TBA | |||
30099D | 034 | Lecture | 5:00-7:20pm | Wednesday | 33 of 55 | Shahriar Shamsian | DEN@Viterbi | ||
30253R | 034 | Discussion | 7:30-8:20pm | Wednesday | 33 of 55 | DEN@Viterbi | |||
30152R | 034 | Quiz | 5:00-6:50pm | Friday | 33 of 55 | DEN@Viterbi |