Computer Science 570:

Analysis of Algorithms (3.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
    30227R048Quiz8:00-9:50pmFriday429 of 500TBAsession dates
    30177R048Lecture6:40-9:20pmWednesday266 of 320Shahriar ShamsianSGM123feesession dates
    30395R048Lecture6:40-9:20pmThursday150 of 320Shahriar ShamsianSGM123feesession dates
    29913R048Discussion9:00-9:50amFriday28 of 58Jeffrey MillerSOSB46session dates
    29916R048Discussion9:00-9:50amFriday45 of 58Michael ShindlerTHH208session dates
    29917R048Discussion10:00-10:50amFriday50 of 58Jeffrey MillerSOSB46session dates
    29918R048Discussion10:00-10:50amFriday33 of 58Michael ShindlerTHH208session dates
    29922R048Discussion11:00-11:50amFriday21 of 58Jeffrey MillerSOSB46session dates
    29924R048Discussion11:00-11:50amFriday55 of 58Michael ShindlerTHH208session dates
    29925R048Discussion12:00-12:50pmFriday27 of 58Jeffrey MillerSOSB46session dates
    29926R048Discussion12:00-12:50pmFriday52 of 59Shahriar ShamsianTHH208session dates
    29927R048Discussion1:00-1:50pmFriday54 of 58Shahriar ShamsianOHE132session dates
    29932R048Discussion1:00-1:50pmFriday51 of 58Michael ShindlerTHH208session dates
    30099D034Lecture6:40-9:20pmWednesday14 of 22Shahriar ShamsianDEN@Viterbifeesession dates
    29952R034Discussion1:00-1:50pmFriday14 of 30DEN@Viterbisession dates
    Information accurate as of October 4, 2015 4:49 pm.