Home Page for CMSC 251 (Algorithms)

Grades will be ready Tuesday afternoon (Dec 17). On my door.

Instructor: Samir Khuller Office: AVW 3217. Office phone: 405--6765. E-mail: samir@cs.umd.edu. Office Hours: Monday: 3pm--4pm, Wednesday 5pm--6pm, Thursday: 11am--12am. If you cannot make these hours, please make an appointment to see me at a different time.

Teaching Assistant: Sungjoon Ahn Office: AVW 4160. Office phone: 405--2724. E-mail: sjahn@cs.umd.edu. Office Hours: Monday: 1-2pm, Wednesday: 1-2pm, Friday: 11-12am. Office hours will be held in AVW 1109. Also by appointment. The BEST way to contact the TA is to send him email.

I will update this page every week during the semester. I will place all homeworks as well as solutions to homeworks here. If you have any trouble accessing them, please let me know. These are in postscript.

Class Time: Tuesday and Thursday 9:30--10.45, CHM0115.

Course Overview: This course presents fundamental techniques for designing and analysing efficient computer algorithms, and proving their correctness. General topics include growth of functions, summations, recurrences, sets, basic probability, sorting and selection, heaps, graphs and NP-completeness.

Text: Thomas Cormen, Charles Leiserson, Ron Rivest, Introduction to Algorithms, McGraw Hill and MIT Press, 1990.

Prerequisites: CMSC 112, CMSC 150, Each student is expected to know the basic concepts of programming (e.g. loops, pointers, recursion), discrete mathematics (proof by induction), and calculus (logarithms, differentiation, integration).

Suggested Syllabus: This is only a rough outline -- we may do things in a different order.

Course Work: Course work will consist of 12 homework assignments, and 3 exams (2 midterm's and a comprehensive final). The midterm's will be in class on Oct and Nov. The final exam will be on Dec 14. Homework problems will generally be mathematically oriented (some of the homeworks may involve programming). Only the best 10 homeworks will be taken into account for the final grade. Homeworks are to be turned in at the start of class on the due date. Homeworks will usually be given out on Tuesday's and will be due a week later. Since homework solutions may be discussed in class, NO LATE HOMEWORKS WILL BE ACCEPTED. (In other words, hand in whatever you have finished.) All class work is to be done independently. Plagiarism will be treated very seriously. Assignments are to be written up NEATLY. Badly written assignments will not be graded. Please staple your homework.

Grading: Final grades will be based on homework assignments, the midterm exam, and the final exam. The relative weights of these will be 10% for the homework total, 25% for each midterm, and 40% for the final exam.

Class Handout

Handout 1 (Tournament)

Handout 2 (Graphs)

Handout 3 (NP-completeness)

Lecture Outline

Homeworks: