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
    29963D901Lecture1:10-3:15pmMTuWTh32 of 120Victor AdamchikOHE122session dates
    29964R901DiscussionTBATBA32 of 120OFFICEsession dates
    29965R901QuizTBATBA32 of 120OFFICEsession dates
    29928D902Lecture4:00-6:50pmMWTh83 of 120Shahriar ShamsianOHE122session dates
    29929R902DiscussionTBATBA83 of 120OFFICEsession dates
    29930R902QuizTBATBA83 of 120OFFICEsession dates
    29966D909Lecture1:10-3:15pmMTuWTh3 of 30Victor AdamchikDEN@Viterbisession dates
    29967R909DiscussionTBATBA3 of 30DEN@Viterbisession dates
    29968R909QuizTBATBA3 of 30DEN@Viterbisession dates
    29931D910Lecture4:00-6:50pmMWTh25 of 40Shahriar ShamsianDEN@Viterbisession dates
    29932R910DiscussionTBATBA25 of 40DEN@Viterbisession dates
    29933R910QuizTBATBA25 of 40DEN@Viterbisession dates
    Information accurate as of January 18, 2024 10:51 am.