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
    30395D048Lecture5:00-7:20pmWednesday309 of 330Shahriar ShamsianSGM123notesession dates
    30089R048Discussion7:30-8:20pmWednesday308 of 330SGM123session dates
    30227R048Quiz5:00-6:50pmFriday308 of 330TBAsession dates
    30198D048Lecture5:00-7:20pmMonday318 of 330Shahriar ShamsianSGM123notesession dates
    30290R048Discussion7:30-8:20pmMonday318 of 330SGM123session dates
    30291R048Quiz5:00-6:50pmFriday318 of 330TBAsession dates
    30099D034Lecture5:00-7:20pmWednesday38 of 50Shahriar ShamsianDEN@Viterbinotesession dates
    29952R034Discussion7:30-8:20pmWednesday38 of 50DEN@Viterbisession dates
    29953R034Quiz5:00-6:50pmFriday38 of 50DEN@Viterbisession dates
    Information accurate as of May 25, 2022 5:05 pm.