600.363 Introduction to Algorithms
600.463 Algorithms I

Course Home Page
General Information/Policies
Course Materials by Lecture Date

Course Description

This is an introductory course in algorithms. We will cover standard topics such as definitions of algorithmic complexity (worst case, average case); basic tools such as sorting, searching and dynamic programming; advanced analysis techniques, such as amortized analysis; graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths; and more advanced topics. Emphasis will be given to arguing the correctness of algorithms and performing an analysis of their running time.


Undergraduates must have successfully completed 600.226 (Data Structures). Please talk to me if you are unsure about your preparation.

Course materials

The book for this class is Introduction to Algorithms (3rd Edition) by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Cliff Stein.

For a list of known bugs and selected solutions to problems in the text, go to http://mitpress.mit.edu/algorithms/.

If you do not have a copy of the textbook, copies are available for purchase at the Johns Hopkins University Bookstore.

The textbook has been placed on reserve at the MSE Library (Building 19).

If you have already purchased a 2nd edition and are concerned about moving to the 3rd edition, please send email to the instructor.

Office Hours

Susan Hohenberger's office hours are Mondays 11-12 (right before class) in Wyman Park room 419 or by appointment.

Ming Chuang's office hours are Thursdays 3-4 in NEB 218 or by appointment.

Course Mailing List

The mailing list is cs363[ignore this spam break]@cs.jhu.edu.

Grading Policy

There will be (approximately) bi-weekly problem sets and three in-class quizzes. The final grade will be computed using the following weights:

Problem Sets

Some of the homework exercises will be routine, but others will be more challenging. I do not expect you to solve all of the homework problems, but I hope that you will benefit from working on the more difficult ones. A few hints on homework:

Quizzes and Exams

There will be three quizzes held during regular class time. The quizzes are closed book, closed note. Calculators, laptops and other electronic devices are prohibited. There is no final exam for this course.
Last modified: Monday, August 24, 2009