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-7:20pmTuesday285 of 330Victor AdamchikSGM123session dates
    29928R048Discussion7:30-8:20pmTuesday285 of 330SGM123session dates
    29923R048Quiz5:00-6:50pmFriday285 of 330TBAsession dates
    30102D048Lecture5:00-7:20pmWednesday325 of 330Victor AdamchikSGM123session dates
    30342R048Discussion7:30-8:20pmWednesday325 of 330SGM123session dates
    30379R048Quiz5:00-6:50pmFriday325 of 330TBAsession dates
    30099D034Lecture5:00-7:20pmWednesday23 of 50Victor AdamchikDEN@Viterbisession dates
    30253R034Discussion7:30-8:20pmWednesday23 of 50DEN@Viterbisession dates
    30152R034Quiz5:00-6:50pmFriday23 of 50DEN@Viterbisession dates
    30274D048Lecture5:00-7:20pmWednesday46 of 76Victor AdamchikOHE136notesession dates
    30275R048Discussion7:30-8:20pmWednesday46 of 76OHE136notesession dates
    30276R048Quiz5:00-6:50pmFriday46 of 76TBAsession dates
    Information accurate as of January 19, 2024 5:02 pm.