Spring 2016
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

Piazza

  • We will be using piazza for announcements and discussions. Please register yourself on Piazza. You can ask private questions (only instructor and TAs can see) or ask/reply anonymously. However DO NOT post your answer and ask if it is correct. If in doubt, ask private question or come during office hours.

Books

  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009). Introduction to Algorithms (3rd ed.). MIT Press (Any edition is fine)
  • Parberry and Gasarch. Problems on Algorithms (free with small suggested donation) 

Teaching Assistants

Midterm Exam

Final Exam

Syllabus

Office Hours
  • Clyde Kruskal: TBA
  • Phong Dinh: TBA