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
    30101D048Lecture5:00-7:20pmMonday314 of 330Shahriar ShamsianSGM123session dates
    29928R048Discussion7:30-8:20pmMonday314 of 330SGM123session dates
    29923R048Quiz5:00-6:50pmFriday314 of 330TBAsession dates
    30102D048Lecture5:00-7:20pmWednesday224 of 241Shahriar ShamsianSGM124session dates
    30342R048Discussion7:30-8:20pmWednesday224 of 241SGM124session dates
    30379R048Quiz5:00-6:50pmFriday224 of 241TBAsession dates
    30274D048Lecture5:00-7:20pmThursday310 of 319Shahriar ShamsianTHH101session dates
    30275R048Discussion7:30-8:20pmThursday310 of 319THH101session dates
    30276R048Quiz5:00-6:50pmFriday310 of 319TBAsession dates
    30099D034Lecture5:00-7:20pmWednesday41 of 50Shahriar ShamsianDEN@Viterbisession dates
    30253R034Discussion7:30-8:20pmWednesday41 of 50DEN@Viterbisession dates
    30152R034Quiz5:00-6:50pmFriday41 of 50DEN@Viterbisession dates
    Information accurate as of March 10, 2022 2:00 pm.
    Did you find what you needed today? Let us know by taking a short survey.