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 |
---|---|---|---|---|---|---|---|---|---|
30101R | 048 | Lecture | 5:00-7:20pm | Monday | 301 of 330 | Victor Adamchik | SGM123 | PDF (198720 KB) | |
29928R | 048 | Discussion | 7:30-8:20pm | Monday | 301 of 330 | SGM123 | |||
29923R | 048 | Quiz | 6:00-8:20pm | Friday | 301 of 330 | Victor Adamchik | TBA | ||
30102R | 048 | Lecture | 5:00-7:20pm | Wednesday | 166 of 330 | Victor Adamchik | SGM123 | PDF (198720 KB) | |
30342R | 048 | Discussion | 7:30-8:20pm | Wednesday | 166 of 330 | SGM123 | |||
30379R | 048 | Quiz | 6:00-8:20pm | Friday | 166 of 330 | Victor Adamchik | TBA | ||
30099D | 034 | Lecture | 5:00-7:20pm | Wednesday | 26 of 50 | Victor Adamchik | DEN@Viterbi | PDF (198720 KB) | |
30253R | 034 | Discussion | 7:30-8:20pm | Wednesday | 26 of 50 | DEN@Viterbi | |||
30152R | 034 | Quiz | 6:00-8:20pm | Friday | 26 of 50 | Victor Adamchik | DEN@Viterbi | ||
30290R | 048 | Lecture | 8:00-9:20am | Mon, Wed | 24 of 30 | Mate Szabo | GFS222 | PDF (199008 KB) | |
30291R | 048 | Discussion | 10:00-10:50am | Friday | 24 of 30 | DMC201 | |||
30292R | 048 | Quiz | 6:00-8:20pm | Friday | 24 of 30 | Mate Szabo | TBA |