ANALYSIS OF ALGORITHMS

Catalog description

Covers fundamental formal techniques and algorithmic strategies that support advanced algorithm design. Topics include: asymptotic complexity bounds, time analysis of iterative and recursive algorithms, advanced data structures such as balanced and red-black trees and hashing, and advanced algorithmic strategies such as dynamic programming. Emphasis on the underlying mathematical theory, practical considerations of efficiency, and algorithm design trade-offs. Prerequisites: CS-311 with a grade of C or higher.