Summer 2019
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.
Course Information

Instructor

  • Clyde Kruskal (kruskal@cs.umd.edu), Office 2240 Brendan Iribe Center

Piazza

    Textbook (on reserve at McKeldin Library)

    • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (3rd ed.). MIT Press (Any edition is fine)

    Supplementary Book

    Exams

Syllabus

Office Hours

Web Accessibility