Algorithm Design and Analysis

Catalog description

This course is about the design and analysis of algorithms. We study specific algorithms for a variety of problems, as well as general design and analysis techniques. Specific topics include searching, sorting, algorithms for graph problems, efficient data structures, lower bounds and NP-completeness. A variety of other topics may be covered at the discretion of the instructor. These include parallel algorithms, randomized algorithms, geometric algorithms, low level techniques for efficient programming, cryptography, and cryptographic protocols. Prerequisites: 15-210 Min. grade C and 21-241 Min. grade C and ( 15-251 Min. grade C or 21-228 Min. grade C) Course Website: https://www.cs.cmu.edu/~15451-f24/