- Please somehow staple your homework so that we don't miss your pages
- A class forum has been created. Please use the forum for your discusions. Link: https://forum.cs.umd.edu/forumdisplay.php?f=153

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.*

- Practice Questions for Final Exam
- Homework 10 Due Friday, July 10, 2009.
- Homework 9 Due Wednesday, July 8, 2009.
- Practice Questions for Midterm Exam
- Homework 8 Due Wednesday, July 1, 2009
- Homework 7 Due Friday, June 26, 2009
- Homework 6 Due Wednesday, June 24, 2009
- Homework 5 Due Friday, June 19, 2009
- Homework 4 Due Wednesday, June 17, 2009
- Homework 3 Due Friday, June 12, 2009
- Homework 2 Due Wednesday, June 10, 2009
- Homework 1 Due Friday, June 5, 2009
- Homework 0

- Class Time/Location
- The class meets
*MTuWThF*, 9:30am-10:45am in CSI 1122 - Instructor
- 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
- Textbook
- Cormen , Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms, second edition, MIT Press and McGraw-Hill