Introduction to Algorithms

Catalog description

This course motivates algorithmic thinking and focuses on the design of algorithms and the rigorous analysis of their efficiency. Topics include the basic definitions of algorithmic complexity (worst case, average case); basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications; graph algorithms and searching techniques such as minimum spanning trees, depth first search, shortest paths, design of randomized algorithms and competitive analysis. Three credits; one-hour laboratory. Pre requisites: AI 208 and 209 or CS 230 and CS