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 |
---|---|---|---|---|---|---|---|---|---|
30227R | 048 | Quiz | 5:00-7:20pm | Friday | 365 of 600 | TGF104 & ONLINE | |||
30177D | 048 | Lecture | 5:00-7:20pm | Tuesday | 237 of 250 | Victor Adamchik | CRC1200 & ONLINE | PDF (231301 KB) | |
30090R | 048 | Discussion | 7:30-8:20pm | Tuesday | 239 of 252 | THH101 & ONLINE | |||
30395D | 048 | Lecture | 5:00-7:20pm | Wednesday | 128 of 250 | Victor Adamchik | SGM124 & ONLINE | PDF (231301 KB) | |
30089R | 048 | Discussion | 7:30-8:20pm | Wednesday | 126 of 250 | SGM124 & ONLINE | |||
30099D | 034 | Lecture | 5:00-7:20pm | Wednesday | 14 of 30 | Victor Adamchik | DEN@Viterbi | PDF (231301 KB) | |
29952R | 034 | Discussion | 7:30-8:20pm | Wednesday | 14 of 30 | DEN@Viterbi | |||
29953R | 034 | Quiz | 5:00-7:20pm | Friday | 14 of 30 | DEN@Viterbi |