600.363 Introduction to Algorithms / 600.463 Algorithms I

Fall 2007

Announcements    Course Information     Text and Course Summary   Homework and Notes   

Course Information:

·         Time and Classroom:

        Shaf 303, MTW 9-10AM

·         Professor

        Baruch Awerbuch   baruch@cs.jhu.edu

        Office: NEB 318; Phone: 410 516 8038;

        Office Hours: Monday, Tuesday and Wednesday, 10:00-10:40AM

·         Teaching Assistant

        Raphael Sznitman sznitman@jhu.edu

Office: NEB 225/227

        Office Hours: Monday and Tuesday 11:00-12:00 AM

·         Course Assistant

        Ming Chuang

Text and Course Summary

·         Primary Textbook

        Introduction to Algorithms, Second Edition,by Cormen, Leiserson, and Rivest, McGraw Hill, 2001.

·         Tentative list of the topics that shall be covered

o        Asymptotic notation and recurrence relations

o        Sorting and selection

o        Lower-bound techniques

o        Union-find trees

o        Dynamic programming

o        Graphs and graph algorithms

o        Hashing

o        Strings and string processing

o        On-line Computing

o        NP-completeness

·         Grading

o        Homeworks: 40%

o        Three Exams: 60%

·         Policies:

o        Late submissions:

    We do not accept late assignments.

o        Students are allowed to discuss assignments, however all scratch-work should be destroyed after the discussion and everyone should write the assignment on his/ her own.

o        Illegible assignments will not be graded.