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
    30039D073Lecture5:00-7:20pmMonday272 of 336Shahriar ShamsianONLINEfeesession dates
    30101D048Lecture5:00-7:20pmMonday
    14 of 1
    Shahriar ShamsianOHE136 & ONLINEfeesession dates
    29928R073Discussion7:30-8:20pmMonday286 of 350ONLINEsession dates
    29923R073Quiz5:00-7:00pmFriday286 of 350ONLINEsession dates
    30041D073Lecture5:00-7:20pmWednesday307 of 345Shahriar ShamsianONLINEfeesession dates
    30102D048Lecture5:00-7:20pmWednesday
    5 of 5
    Shahriar ShamsianOHE136 & ONLINEfeesession dates
    30342R073Discussion7:30-8:20pmWednesday312 of 350ONLINEsession dates
    30379R073Quiz5:00-7:00pmFriday312 of 350ONLINEsession dates
    30099D034Lecture5:00-7:20pmWednesday20 of 50Shahriar ShamsianDEN@Viterbifeesession dates
    30253R034Discussion7:30-8:20pmWednesday20 of 50DEN@Viterbisession dates
    30152R034Quiz5:00-7:00pmFriday20 of 50DEN@Viterbisession dates
    Information accurate as of March 15, 2021 8:10 am.
    Did you find what you needed today? Let us know by taking a short survey.