CMSC 451 - Design and Analysis of Computer Algorithms

Course Description

Fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their complexity. General topics include sorting, selection, graph algorithms, and basic algorithm design paradigms (such as divide-and-conquer, dynamic programming and greedy algorithms), lower bounds and NP-completeness.

General Information

Class Time/Location
The class meets Tuesdays and Thursdays, 9:30-10:45am in CSI 2107
Clyde Kruskal
Office Hours
Tuesday, Thursday 10:45am-12:00pm; AVW 3215
Teaching Assistant
MohammadReza Ghodsi
TA Office Hours
Tuesday 12:30-2:30pm, Thursday 12:30-1:30pm; AVW 1112


ps pdf


Homeworks are due at the start of class.