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
    30097D048Lecture12:30-1:50pmTue, Thu
    Canceled
    feesession dates
    30099D034Lecture5:00-7:50pmWednesday15 of 22Shahriar ShamsianDEN@Viterbifeesession datesbook list
    30100D048Lecture10:00-11:50amMon, Wed
    60 of 60
    Michael ShindlerTHH208notefeesession datesbook list
    30101D048Lecture2:00-3:20pmMon, Wed58 of 60Michael ShindlerTHH208feesession datesbook list
    30112D048Lecture5:00-6:20pmMon, Wed58 of 60Michael ShindlerTHH102feesession datesbook list
    30177D048Lecture5:00-7:50pmWednesday
    Canceled
    feesession dates
    30236D048Lecture5:00-7:50pmWednesday229 of 244Shahriar ShamsianSGM124feesession datesbook list
    30395D048Lecture5:00-7:50pmThursday
    Canceled
    feesession dates
    Information accurate as of 8/31/2014 2:56 PM.