Summer 2017
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 3215 AV Williams

Class Time / Venue

  • M-F 9:30am - 10:55am @ CSI 1115

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

    • Midterm: Wednesday, June 28, 8:45am
    • Final: Friday, July 7, 8:45am

    Syllabus

Office Hours