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.
    SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
    30227R048Quiz5:00-7:20pmFriday539 of 575TBAsession dates
    30177D048Lecture5:00-7:20pmTuesday315 of 331Victor AdamchikSGM123notefeesession dates
    30090R048Discussion7:30-8:20pmTuesday316 of 333Victor AdamchikSGM123session dates
    30395D048Lecture5:00-7:20pmWednesday224 of 244Victor AdamchikSGM124notefeesession dates
    30089R048Discussion7:30-8:20pmWednesday222 of 244Victor AdamchikSGM124session dates
    30099D034Lecture5:00-7:20pmWednesday28 of 34Victor AdamchikDEN@Viterbinotefeesession dates
    29952R034Discussion7:30-8:20pmWednesday29 of 34DEN@Viterbisession dates
    29953R034Quiz5:00-7:20pmFriday28 of 34DEN@Viterbisession dates
    Information accurate as of September 27, 2020 10:48 am.
    The Fall 2020 semester will begin with fully remote instruction, with limited exceptions for clinical education. Faculty will contact students to provide information to login to classes. Read more.