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 |
---|---|---|---|---|---|---|---|---|---|
29934D | 901 | Lecture | 1:00-3:50pm | TuWTh | 40 of 80 | Victor Adamchik | SGM123 | ||
29935R | 901 | Discussion | TBA | TBA | 40 of 80 | OFFICE | |||
29936R | 901 | Quiz | TBA | TBA | 40 of 80 | OFFICE | |||
29940D | 902 | Lecture | 1:00-3:50pm | MTuW | 121 of 140 | Shahriar Shamsian | SGM123 | ||
29941R | 902 | Discussion | TBA | TBA | 121 of 140 | OFFICE | |||
29942R | 902 | Quiz | TBA | TBA | 121 of 140 | OFFICE | |||
29937D | 909 | Lecture | 1:00-3:50pm | TuWTh | 3 of 20 | Victor Adamchik | DEN@Viterbi | ||
29938R | 909 | Discussion | TBA | TBA | 3 of 20 | OFFICE | |||
29939R | 909 | Quiz | TBA | TBA | 3 of 20 | OFFICE | |||
29943D | 910 | Lecture | 1:00-3:50pm | MTuW | 17 of 25 | Shahriar Shamsian | DEN@Viterbi | ||
29944R | 910 | Discussion | TBA | TBA | 17 of 25 | OFFICE | |||
29945R | 910 | Quiz | TBA | TBA | 17 of 25 | OFFICE |