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
    30177D048Lecture6:40-9:20pmWednesday211 of 214Shahriar ShamsianSGM123feesession datesbook list
    30395D048Lecture6:55-9:35pmThursday186 of 191Shahriar ShamsianSGM123feesession datesbook list
    29913R048Discussion9:00-9:50amFriday71 of 72Jeffrey MillerTHH208session dates
    29917R048Discussion10:00-10:50amFriday
    60 of 60
    Jeffrey MillerTHH116session dates
    29922D048Discussion11:00-11:50amFriday59 of 60Jeffrey MillerTHH116session dates
    29925R048Discussion12:00-12:50pmFriday57 of 58Shahriar ShamsianVKC100session dates
    29926R048Discussion12:00-12:50pmFriday69 of 72Jeffrey MillerTHH208session dates
    29927R048Discussion1:00-1:50pmFriday81 of 82Shahriar ShamsianOHE132session dates
    30227R048Quiz8:00-9:50pmFriday396 of 405TBAsession dates
    30099D034Lecture6:40-9:20pmWednesday12 of 25Shahriar ShamsianDEN@Viterbifeesession datesbook list
    29952R034Discussion1:00-1:50pmFriday12 of 25DEN@Viterbisession dates
    29953R034Quiz8:00-9:50pmFriday12 of 25DEN@Viterbisession dates
    Information accurate as of October 5, 2016 8:25 am.