CMSC 451

Design and Analysis of Computer Algorithms;

Summer, 2007


Course Outline

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

Course Information

Syllabus

HOMEWORKS

EXAMS