Computer Science 570:

Analysis of Algorithms (3.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.
  • Note: Register for lecture and discussion.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
30331R901Lecture1:00-2:40pmMTuWTh41 of 76Shahriar ShamsianOHE136notefeesession datesbook list
30042R901DiscussionTBATBA41 of 76OFFICEsession dates
30332D909Lecture1:00-2:40pmMTuWTh10 of 20Shahriar ShamsianDEN@Viterbinotefeesession datesbook list
30043R909DiscussionTBATBA10 of 20DEN@Viterbisession dates
Information accurate as of 8/31/2014 9:55 AM.