Offered through the University of Maryland

CMSC451: Design and Analysis of Algorithms is a University of Maryland course that presents fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their performance. Topics to be covered include graph algorithms, greedy algorithms, divide-and-conquer algorithms, dynamic programming, network flow algorithms, computational intractability, approximation algorithms, randomized algorithms, and quantum algorithms.

The subject is taught to University of Maryland upper-level undergraduate students. Details for the class are here.

← CMSC330: Organization of Programming Languages | Class Archive | CMSC651: Advanced Algorithms →


I’m Kevin Chen, and this is my personal website. I am a second-year student in the CS department at the University of Maryland. ¶ My research interests are in machine learning and theoretical computer science. In my free time, I enjoy reading, filmmaking and helping out with Bitcamp.


To receive updates from this site, you can subscribe to the  RSS feed of all updates to the site in an RSS feed reader.