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
    30177D048Lecture5:00-7:20pmMonday323 of 331Shahriar ShamsianSGM123feesession datesbook list
    30289R048Discussion7:30-8:20pmMonday323 of 331SGM123session dates
    30227R048Quiz8:00-9:50pmFriday323 of 331TBAsession dates
    30395D048Lecture5:00-7:20pmThursday315 of 330Shahriar ShamsianSGM123feesession dates
    30290R048Discussion7:30-8:20pmThursday315 of 330session dates
    30291R048Quiz7:00-8:50pmFriday315 of 330TBAsession dates
    30099D034Lecture5:00-7:20pmMonday26 of 30DEN@Viterbifeesession dates
    29952R034Discussion7:30-8:20pmMonday25 of 30DEN@Viterbisession dates
    29953R034Quiz8:00-9:50pmFriday25 of 30DEN@Viterbisession dates
    Information accurate as of April 25, 2019 5:27 pm.