CMSC 351 - Algorithms


Course Description

This course presents an introduction to the techniques for designing efficient computer algorithms and analyzing their running times. General topics include asymptotics, solving summations and recurrences, algorithm design techniques, analysis of data structures , and introduction to NP-completeness.

General Information

Class Time/Location
The class meets every weekday, 9:30am-10:45am in CSI 1122
Clyde Kruskal (Email:
Office Hours
Monday, Wednesday, and Friday: 10:45am-12:00pm; AVW 3215
Also by appointment
Teaching Assistant
Xue Wu (Email:
Office Hours
Tuesday and Thursday: 11:00am-1:00pm; AVW 1112
Also by appointment
Teaching Assistant
Hu Qi (Email:
Office Hours
By appointment
Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms, second edition, MIT Press and McGraw-Hill

Syllabus [ps][pdf]


Homeworks are due at the start of class.


Web Accessibility