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.
    30227R048Quiz5:00-7:20pmFriday365 of 600TGF104 & ONLINEsession dates
    30177D048Lecture5:00-7:20pmTuesday237 of 250Victor AdamchikCRC1200 & ONLINEPDF (231301 KB)notefeesession dates
    30090R048Discussion7:30-8:20pmTuesday239 of 252THH101 & ONLINEsession dates
    30395D048Lecture5:00-7:20pmWednesday128 of 250Victor AdamchikSGM124 & ONLINEPDF (231301 KB)notefeesession dates
    30089R048Discussion7:30-8:20pmWednesday126 of 250SGM124 & ONLINEsession dates
    30099D034Lecture5:00-7:20pmWednesday14 of 30Victor AdamchikDEN@ViterbiPDF (231301 KB)notefeesession dates
    29952R034Discussion7:30-8:20pmWednesday14 of 30DEN@Viterbisession dates
    29953R034Quiz5:00-7:20pmFriday14 of 30DEN@Viterbisession dates
    Information accurate as of September 10, 2021 2:03 pm.
    In Fall 2021, USC is returning to the normal grade option election deadlines and standards. For more information on this, please visit the Fall 2021 academic FAQs.