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
    30101D048Lecture5:00-6:50pmMon, Wed323 of 330Shahriar ShamsianSGM123feesession dates
    30102D048Lecture7:00-8:50pmMon, Wed322 of 330Shahriar ShamsianSGM123feesession dates
    29915R048DiscussionTBATBA645 of 660OFFICEsession dates
    29923R048Quiz7:00-8:50pmFriday645 of 660TBAsession dates
    30099D034Lecture5:00-6:50pmMon, Wed36 of 45Shahriar ShamsianDEN@Viterbifeesession dates
    30253R034DiscussionTBATBA36 of 45DEN@Viterbisession dates
    30152R034Quiz7:00-8:50pmFriday36 of 45DEN@Viterbisession dates
    Information accurate as of February 22, 2020 5:01 pm.