Spring 2015
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)

Class Time / Venue

  • 0101: MWF 9:00am - 9:50am @ CSI 1115
  • 0201: MWF 10:00am - 10:50am @ CSI 1115
  • 0301: MWF 1:00pm - 1:50pm @ CSI 2117

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

  • Melika Abolhassani (melika.abolhasani@gmail.com)
  • Soheil Ehsani Banafati (soheilehsani@yahoo.com)
  • Zikai Wen (zkwen@umd.edu@cs.umd.edu)

Syllabus

Office Hours
  • Clyde: Mon,Wed 11:00AM - Noon, Fri 2:00PM - 3:00PM
  • Melika: Tue 4:00PM - 7:00PM
  • Soheil: Tue 9:00AM - 12:00PM
  • Zikai: Mon 2:00PM - 5:00PM