Course Information

CS3413 Design & Analysis of Algorithms

Credits: 3.00

This course covers fundamental principles of the design and analysis of algorithms. Topics include asymptotic notation, recurrences, randomized algorithms, sorting and selection, balanced binary search trees, augmented data structures, advanced data structures, algorithms on strings, graph algorithms, geometric algorithms, greedy algorithms, dynamic programming and NP completeness.

Prerequisites: CS 2134 (C- or better) and MA 2312/2322.