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.


Homeworks are due at the start of class.


General Information

Class Time/Location
The class meets MTuWThF, 9:30am-10:45am in CSI 1122
Clyde Kruskal (Email: kruskal@cs)
Office Hours
Monday, Wednesday, and Friday: 10:45am–12:00pm; AVW 3215
Teaching Assistant
Bao Nguyen (Email: baonn @cs)
Office Hours
Tuesday and Thursday: 11:00am-1:00pm; AVW 1112
Cormen , Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms, second edition, MIT Press and McGraw-Hill

Syllabus (pdf)