Prerequisites

600.109 Introduction to Programming. Students are expected to be familiar with some higher-level programming language, preferably Java.

Course Summary

The goal of the course is teach fundamental data structures, which allow one to store collections of objects with fast updates and queries. The course topics include the following:

• Optional Overview of Java (provided in extra sections by course TA).
• Introduction to object-oriented design.
• Stacks, queues, and linked lists.
• Containers and sequences.
• Trees.
• Priority queues.
• Dictionaries.
• Sorting.
• Graphs.

Grading

The course grade is determined by the total number of points earned by the student during the semester. There are 1000 points possible, distributed as follows:

50 pts. attendance (5 free missed days allowed, -5 points for each one after that)

200 pts. 5 written homework assignments

400 pts. 4 programming assignments

150 pts. midterm examination, TBA.

200 pts. Final examination, TBA.

Late policy: 10% off for each day late. No credit if more than 5 days late.

Text

Goodrich, Tamassia, Data Structures and Algorithms in Java, John Wiley and Sons, Inc., 1998.

See the course web site (http://www.cgc.cs.jhu.edu/~goodrich/teach/ds/ ) for updates and news.

Copyright 1999 Michael T. Goodrich as to this syllabus and all lectures. Students are prohibited from selling (or being paid for taking) notes during this course to or by any person or commercial firm without the express written permission of the professor teaching this course.